Lax54.ErdosHajnalC5
Erdős–Hajnal theorem for the five-cycle
concepts/Lax54/ErdosHajnalC5.lean · lax-54
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
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 such that every finite graph with no induced five-cycle satisfies .
Lean source view on GitHub
| 1 | import Lax54.GraphDefinitions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Erdős–Hajnal theorem for the five-cycle |
| 6 | type: theorem |
| 7 | --- |
| 8 | The five-cycle has the Erdős–Hajnal property. Equivalently, there is a |
| 9 | positive integer such that every finite graph with no induced |
| 10 | five-cycle satisfies |
| 11 | . |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax54.ErdosHajnalC5 |
| 15 | |
| 16 | open Lax54.GraphDefinitions |
| 17 | |
| 18 | universe u |
| 19 | |
| 20 | /-- The Erdős–Hajnal property for the five-cycle, in integer-exponent form. -/ |
| 21 | axiom 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 | |
| 26 | end Lax54.ErdosHajnalC5 |
| 27 |
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