Lax Lean Archive

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

Lax17.NodeWellLinkedSetFromTreewidth

A well-linked set from treewidth

concepts/Lax17/NodeWellLinkedSetFromTreewidth.lean · lax-17

proven

Loading review…

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

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

    Large treewidth yields a proportionally large node-well-linked set.

    Lean source view on GitHub

    1import Lax17.Linkedness
    2import Lax17.Treewidth
    3
    4/-!
    5---
    6title: A well-linked set from treewidth
    7type: theorem
    8---
    9Large treewidth yields a proportionally large node-well-linked set.
    10-/
    11
    12namespace Lax17.NodeWellLinkedSetFromTreewidth
    13
    14universe u
    15
    16/-- Large treewidth yields a large node-well-linked vertex set. -/
    17axiom nodeWellLinkedSetFromTreewidth :
    18 ∃ c : ℕ, 0 < c ∧
    19 ∀ {V : Type u} [Fintype V] [DecidableEq V]
    20 (G : SimpleGraph V) {k : ℕ},
    21 c * k ≤ Lax17.Treewidth.treewidth G →
    22 ∃ X : Finset V,
    23 k ≤ X.card ∧
    24 Lax17.Linkedness.NodeWellLinkedIn G Finset.univ X
    25
    26end Lax17.NodeWellLinkedSetFromTreewidth
    27
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    none

    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…