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

Lax57.SparseHouseTools

Anticomplete pairs in sparse P5P_5-free graphs

concepts/Lax57/SparseHouseTools.lean · lax-57

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

    Evidence

    Each proof establishes this claim relative to its assumptions.

    Theorem

    A 1/321/32-sparse P5P_5-free graph on a set SS of at least two vertices has two anticomplete sets, each of size at least S/32|S|/32. This is Lemma 4.4 of Nguyen, Scott, and Seymour.

    Lean source view on GitHub

    1import Lax57.GraphDefinitions
    2
    3/-!
    4---
    5title: Anticomplete pairs in sparse P5P_5-free graphs
    6type: theorem
    7---
    8A 1/321/32-sparse P5P_5-free graph on a set SS of at least two vertices
    9has two anticomplete sets, each of size at least S/32|S|/32. This is Lemma 4.4
    10of Nguyen, Scott, and Seymour.
    11-/
    12
    13namespace Lax57.SparseHouseTools
    14
    15open Lax57.GraphDefinitions
    16
    17universe u
    18
    19/-- The linear anticomplete-pair lemma for sparse `P5`-free graphs. -/
    20axiom sparse_P5_anticomplete_pair :
    21 ∀ {V : Type u} [Fintype V] [DecidableEq V]
    22 (G : SimpleGraph V) [DecidableRel G.Adj] (S : Finset V),
    23 IsP5Free G → 2 ≤ S.card → ESparse G 32 S →
    24 ∃ B : Blockade (V := V) 2,
    25 B.IsInside S ∧ B.IsAnticomplete G ∧
    26 ∀ i : Fin 2, S.card ≤ 32 * (B.block i).card
    27
    28end Lax57.SparseHouseTools
    29
    Show Proof

    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…