The fractional-coloring counterexample
Lax342547.FractionalCounterexample · concepts/Lax342547/FractionalCounterexample.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Corollary 1.2 asserts that there are graphs of arbitrarily large order with independence number at most two and . Here refers to ordinary clique minors.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax342547.CliqueMinor |
| 2 | import Lax342547.FractionalColoring |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: The fractional-coloring counterexample |
| 7 | type: theorem |
| 8 | --- |
| 9 | Corollary 1.2 asserts that there are graphs of arbitrarily large order |
| 10 | with independence number at most two and |
| 11 | . |
| 12 | Here refers to ordinary clique minors. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax342547.FractionalCounterexample |
| 16 | |
| 17 | open CliqueMinor FractionalColoring |
| 18 | |
| 19 | axiom arbitrarily_large_fractional_counterexample (lowerBound : ℕ) : |
| 20 | ∃ m : ℕ, lowerBound ≤ m ∧ 5 ≤ m ∧ ∃ G : SimpleGraph (Fin m), |
| 21 | G.indepNum ≤ 2 ∧ |
| 22 | (hadwigerNumber G : ℝ) < 26 * (m : ℝ) / 75 + 2 / 3 ∧ |
| 23 | 26 * (m : ℝ) / 75 + 2 / 3 < (m : ℝ) / 2 ∧ |
| 24 | (m : ℝ) / 2 ≤ fractionalChromaticNumber G ∧ |
| 25 | fractionalChromaticNumber G ≤ (G.chromaticNumber.toNat : ℝ) |
| 26 | |
| 27 | end Lax342547.FractionalCounterexample |
| 28 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments