Lax57.SparseHouseTools
Anticomplete pairs in sparse -free graphs
concepts/Lax57/SparseHouseTools.lean · lax-57
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Theorem
A -sparse -free graph on a set of at least two vertices has two anticomplete sets, each of size at least . This is Lemma 4.4 of Nguyen, Scott, and Seymour.
Lean source view on GitHub
| 1 | import Lax57.GraphDefinitions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Anticomplete pairs in sparse -free graphs |
| 6 | type: theorem |
| 7 | --- |
| 8 | A -sparse -free graph on a set of at least two vertices |
| 9 | has two anticomplete sets, each of size at least . This is Lemma 4.4 |
| 10 | of Nguyen, Scott, and Seymour. |
| 11 | -/ |
| 12 | |
| 13 | namespace Lax57.SparseHouseTools |
| 14 | |
| 15 | open Lax57.GraphDefinitions |
| 16 | |
| 17 | universe u |
| 18 | |
| 19 | /-- The linear anticomplete-pair lemma for sparse `P5`-free graphs. -/ |
| 20 | axiom sparse_P5_anticomplete_pair : |
| 21 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 22 | (G : SimpleGraph V) [DecidableRel G.Adj] (S : Finset V), |
| 23 | IsP5Free G → 2 ≤ S.card → ESparse G 32 S → |
| 24 | ∃ B : Blockade (V := V) 2, |
| 25 | B.IsInside S ∧ B.IsAnticomplete G ∧ |
| 26 | ∀ i : Fin 2, S.card ≤ 32 * (B.block i).card |
| 27 | |
| 28 | end Lax57.SparseHouseTools |
| 29 |
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments