Combinatorics
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«128»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos128.erdos_128" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (V : Type) [inst : Fintype V] (G : SimpleGraph V),
(∀ (V' : Set V),
2 * V'.ncard + 1 ≥ Fintype.card V → 50 * (SimpleGraph.induce V' G).edgeSet.ncard > Fintype.card V ^ 2) →
¬G.CliqueFree 3Original conjecture source: FormalConjectures/ErdosProblems/128.lean
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.