Lax Lean Archive

Erdős–Hajnal theorem for the five-vertex path

Lax57.ErdosHajnalP5 · concepts/Lax57/ErdosHajnalP5.lean · lax-57

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.

    Natural Language Statement

    Theorem

    The five-vertex path P5P_5 has the Erdős–Hajnal property: there is a positive integer qq such that every finite graph GG with no induced copy of P5P_5 satisfies

    ∣V(G)∣≤max⁡{α(G),ω(G)}q.|V(G)| \leq \max\{\alpha(G),\omega(G)\}^{q}.
    Concept map
    3 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 2 of this submission's paper

    Lean source view on GitHub

    1import Lax57.GraphDefinitions
    2
    3/-!
    4---
    5title: Erdős–Hajnal theorem for the five-vertex path
    6type: theorem
    7---
    8The five-vertex path P5P_5 has the Erdős–Hajnal property: there is a positive
    9integer qq such that every finite graph GG with no induced copy of P5P_5
    10satisfies
    11
    12
    13∣V(G)∣≤max⁡{α(G),ω(G)}q.|V(G)| \leq \max\{\alpha(G),\omega(G)\}^{q}.
    14
    15-/
    16
    17namespace Lax57.ErdosHajnalP5
    18
    19open Lax57.GraphDefinitions
    20
    21universe u
    22
    23/-- The Erdős–Hajnal conjecture for the five-vertex path. -/
    24axiom erdos_hajnal_P5 :
    25 ∃ q : ℕ, 0 < q ∧
    26 ∀ {V : Type u} [Fintype V] (G : SimpleGraph V),
    27 IsP5Free G → Fintype.card V ≤ homogeneousNumber G ^ q
    28
    29end Lax57.ErdosHajnalP5
    30
    Show Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…