Lax57.ErdosHajnalP5
Erdős–Hajnal theorem for the five-vertex path
concepts/Lax57/ErdosHajnalP5.lean · lax-57
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Evidence
Each proof establishes this claim relative to its assumptions.
Theorem
The five-vertex path has the Erdős–Hajnal property: there is a positive integer such that every finite graph with no induced copy of satisfies
Lean source view on GitHub
| 1 | import Lax57.GraphDefinitions |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Erdős–Hajnal theorem for the five-vertex path |
| 6 | type: theorem |
| 7 | --- |
| 8 | The five-vertex path has the Erdős–Hajnal property: there is a positive |
| 9 | integer such that every finite graph with no induced copy of |
| 10 | satisfies |
| 11 | |
| 12 | |
| 13 | |
| 14 | |
| 15 | -/ |
| 16 | |
| 17 | namespace Lax57.ErdosHajnalP5 |
| 18 | |
| 19 | open Lax57.GraphDefinitions |
| 20 | |
| 21 | universe u |
| 22 | |
| 23 | /-- The Erdős–Hajnal conjecture for the five-vertex path. -/ |
| 24 | axiom 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 | |
| 29 | end Lax57.ErdosHajnalP5 |
| 30 |
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