Lax17.TreewidthSparsifier
Degree-three treewidth sparsifier
concepts/Lax17/TreewidthSparsifier.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
Large treewidth contains a degree-three spanning subgraph that preserves treewidth up to a polylogarithmic factor.
Lean source view on GitHub
| 1 | import Mathlib.Data.Nat.Log |
| 2 | import Lax17.Degree |
| 3 | import Lax17.Treewidth |
| 4 | |
| 5 | /-! |
| 6 | --- |
| 7 | title: Degree-three treewidth sparsifier |
| 8 | type: theorem |
| 9 | --- |
| 10 | Large treewidth contains a degree-three spanning subgraph that preserves |
| 11 | treewidth up to a polylogarithmic factor. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax17.TreewidthSparsifier |
| 15 | |
| 16 | universe u |
| 17 | |
| 18 | /-- If `G` has treewidth at least `k > 1`, it has a spanning subgraph `H` of |
| 19 | maximum degree three for which |
| 20 | `k ≤ c · treewidth(H) · (log₂ k)^d`. -/ |
| 21 | axiom degreeThreeTreewidthSparsifier : |
| 22 | ∃ c d : ℕ, 0 < c ∧ 0 < d ∧ |
| 23 | ∀ {V : Type u} [Fintype V] [DecidableEq V] |
| 24 | (G : SimpleGraph V) {k : ℕ}, |
| 25 | 1 < k → |
| 26 | k ≤ Lax17.Treewidth.treewidth G → |
| 27 | ∃ H : SimpleGraph V, |
| 28 | H ≤ G ∧ |
| 29 | Lax17.Degree.MaximumAtMost H 3 ∧ |
| 30 | k ≤ c * Lax17.Treewidth.treewidth H * |
| 31 | (Nat.log 2 k) ^ d |
| 32 | |
| 33 | end Lax17.TreewidthSparsifier |
| 34 |
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