Combinatorics
Date added
$1,036 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«159»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos159.erdos_159" := by
sorry
end Bounty
Original conjecture (Lean type)
∃ c,
∃ (_ : 0 < c),
∃ C,
∀ (n : ℕ),
1 ≤ n → ↑((SimpleGraph.cycleGraph 4).graphRamsey (SimpleGraph.completeGraph (Fin n))) ≤ C * ↑n ^ (2 - c)Original conjecture source: FormalConjectures/ErdosProblems/159.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.