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

Lax54.ErdosHajnalC5

Erdős–Hajnal theorem for the five-cycle

concepts/Lax54/ErdosHajnalC5.lean · lax-54

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

    The five-cycle has the Erdős–Hajnal property. Equivalently, there is a positive integer qq such that every finite graph GG with no induced five-cycle satisfies V(G)max{α(G),ω(G)}q|V(G)|\leq \max\{\alpha(G),\omega(G)\}^q.

    Lean source view on GitHub

    1import Lax54.GraphDefinitions
    2
    3/-!
    4---
    5title: Erdős–Hajnal theorem for the five-cycle
    6type: theorem
    7---
    8The five-cycle has the Erdős–Hajnal property. Equivalently, there is a
    9positive integer qq such that every finite graph GG with no induced
    10five-cycle satisfies
    11V(G)max{α(G),ω(G)}q|V(G)|\leq \max\{\alpha(G),\omega(G)\}^q.
    12-/
    13
    14namespace Lax54.ErdosHajnalC5
    15
    16open Lax54.GraphDefinitions
    17
    18universe u
    19
    20/-- The Erdős–Hajnal property for the five-cycle, in integer-exponent form. -/
    21axiom erdos_hajnal_C5 :
    22 ∃ q : ℕ, 0 < q ∧
    23 ∀ {V : Type u} [Fintype V] (G : SimpleGraph V),
    24 IsC5Free G → Fintype.card V ≤ homogeneousNumber G ^ q
    25
    26end Lax54.ErdosHajnalC5
    27
    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…