Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax17.HairyPathOfSetsFromTreewidth

A hairy path-of-sets system from treewidth

concepts/Lax17/HairyPathOfSetsFromTreewidth.lean · lax-17

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Theorem

    Sufficiently large treewidth produces a hairy strong path-of-sets system.

    Lean source view on GitHub

    1import Mathlib.Data.Nat.Log
    2import Lax17.Degree
    3import Lax17.PathOfSets
    4import Lax17.Treewidth
    5
    6/-!
    7---
    8title: A hairy path-of-sets system from treewidth
    9type: theorem
    10---
    11Sufficiently large treewidth produces a hairy strong path-of-sets system.
    12-/
    13
    14namespace Lax17.HairyPathOfSetsFromTreewidth
    15
    16universe u
    17
    18/-- Sufficiently large treewidth produces a hairy strong path-of-sets
    19system. -/
    20axiom 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
    34end Lax17.HairyPathOfSetsFromTreewidth
    35
    Show Proof

    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

    Loading discussion…