Lax57.SemisparseBlockade
Polynomial semisparse blockades for the house
concepts/Lax57/SemisparseBlockade.lean · lax-57
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
This is the denominator-cleared form of Lemma 6.2 of Nguyen, Scott, and Seymour. A sufficiently large house-free graph contains disjoint polynomially large blocks, and every pair of blocks is either complete or has edge density at most .
Lean source view on GitHub
| 1 | import Lax57.GraphDefinitions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Polynomial semisparse blockades for the house |
| 6 | type: theorem |
| 7 | --- |
| 8 | This is the denominator-cleared form of Lemma 6.2 of Nguyen, Scott, and |
| 9 | Seymour. A sufficiently large house-free graph contains disjoint |
| 10 | polynomially large blocks, and every pair of blocks is either complete or |
| 11 | has edge density at most . |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax57.SemisparseBlockade |
| 15 | |
| 16 | open Lax57.GraphDefinitions |
| 17 | |
| 18 | universe u |
| 19 | |
| 20 | /-- Polynomial semisparse blockades in house-free graphs. -/ |
| 21 | axiom semisparse_house_blockade : |
| 22 | ∃ d : ℕ, 40 ≤ d ∧ |
| 23 | ∀ E : ℕ, 2 ≤ E → |
| 24 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 25 | (G : SimpleGraph V) [DecidableRel G.Adj], |
| 26 | IsHouseFree G → E ^ (10 * d ^ 2) ≤ Fintype.card V → |
| 27 | ∃ B : Blockade (V := V) E, |
| 28 | B.IsSemisparse G (E ^ d) ∧ |
| 29 | B.HasWidthLoss (E ^ (10 * d ^ 2)) |
| 30 | |
| 31 | end Lax57.SemisparseBlockade |
| 32 |
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