Lax17.HairyPathOfSetsFromTreewidth
A hairy path-of-sets system from treewidth
concepts/Lax17/HairyPathOfSetsFromTreewidth.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
Sufficiently large treewidth produces a hairy strong path-of-sets system.
Lean source view on GitHub
| 1 | import Mathlib.Data.Nat.Log |
| 2 | import Lax17.Degree |
| 3 | import Lax17.PathOfSets |
| 4 | import Lax17.Treewidth |
| 5 | |
| 6 | /-! |
| 7 | --- |
| 8 | title: A hairy path-of-sets system from treewidth |
| 9 | type: theorem |
| 10 | --- |
| 11 | Sufficiently large treewidth produces a hairy strong path-of-sets system. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax17.HairyPathOfSetsFromTreewidth |
| 15 | |
| 16 | universe u |
| 17 | |
| 18 | /-- Sufficiently large treewidth produces a hairy strong path-of-sets |
| 19 | system. -/ |
| 20 | axiom hairyPathOfSetsFromTreewidth : |
| 21 | ∃ c d : ℕ, 0 < c ∧ 0 < d ∧ |
| 22 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 23 | (G : SimpleGraph V) {ℓ w k : ℕ}, |
| 24 | 1 < ℓ → |
| 25 | 1 < w → |
| 26 | 1 < k → |
| 27 | k ≤ Lax17.Treewidth.treewidth G → |
| 28 | c * w * ℓ ^ 50 * (Nat.log 2 k) ^ d < k → |
| 29 | ∃ H : SimpleGraph V, |
| 30 | H ≤ G ∧ |
| 31 | Lax17.Degree.MaximumAtMost H 3 ∧ |
| 32 | Nonempty (Lax17.PathOfSets.HairySystem H ℓ w) |
| 33 | |
| 34 | end Lax17.HairyPathOfSetsFromTreewidth |
| 35 |
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