Combinatorics
Date added
$995 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«545»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos545.erdos_545" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ᶠ (m : ℕ) in Filter.atTop,
∀ (n t : ℕ),
t < n →
m = n.choose 2 + t →
∀ (V : Type) [inst : Fintype V] (G : SimpleGraph V) [inst_1 : DecidableRel G.Adj],
(∀ (v : V), 0 < G.degree v) →
G.edgeSet.ncard = m → G.diagonalGraphRamsey ≤ (Erdos545.knPlusTEdges n t).diagonalGraphRamseyOriginal conjecture source: FormalConjectures/ErdosProblems/545.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.