Combinatorics
erdos_1175.variants.shelah_consistency).
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«1175»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos1175.erdos_1175" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (κ : Cardinal.{u_1}),
Cardinal.aleph0 < κ →
∃ μ,
∀ (V : Type u_1) (G : SimpleGraph V),
G.chromaticCardinal = μ → ∃ H, H.coe.CliqueFree 3 ∧ H.coe.chromaticCardinal = κOriginal conjecture source: FormalConjectures/ErdosProblems/1175.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.