Combinatorics
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«61»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos61.erdos_61" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ {α : Type u_1} [inst : Fintype α] [inst_1 : DecidableEq α] (H : SimpleGraph α),
∃ c > 0, Erdos61.IsErdosHajnalLowerBound H fun n => ↑n ^ cOriginal conjecture source: FormalConjectures/ErdosProblems/61.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.