Combinatorics
Date added
$991 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«151»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos151.erdos_151" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (n : ℕ) (G : SimpleGraph (Fin n)), Erdos151.cliqueTransversalNumber G ≤ n - Erdos151.H nOriginal conjecture source: FormalConjectures/ErdosProblems/151.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.