Skip to content

Problems · Vela Mathematics Program

Narrowed todisproved (Lean) ×chromatic number ×Clear all

Problem ledger

3 problemsGraph view
declared disproved (Lean) · formalizederdos:751
False ↔ ∀ (k : ℕ), ∃ V G, G.chromaticNumber = 4 ∧ ∀ m ∈ G.cycleLengths, ∀ m' ∈ G.cycleLengths, m < m' → m + k ≤ m'
graph theorychromatic numberN/A5 sources
declared disproved (Lean) · formalizederdos:753
False ↔ ∃ c, 0 < c ∧ ∀ (n : ℕ), 0 < n → ∀ (G : SimpleGraph (Fin n)), ↑n ^ (1 / 2 + c) < ↑(Erdos753.listChromaticNumber G) + ↑(Erdos753.listChromaticNumber Gᶜ)
graph theorychromatic numberN/A5 sources
declared disproved (Lean) · formalizederdos:762
False ↔ ∀ (V : Type u_1) [Fintype V] (G : SimpleGraph V), G.CliqueFree 5 → 4 ≤ G.cochromaticNumber → G.chromaticNumber ≤ G.cochromaticNumber + 2
graph theorychromatic numberN/A5 sources

Search problems.science

Find a Problem, Result, source, or page