Erdős–Hajnal for the five-vertex path
No public endorsements yet.
Loading review…
Sign in with ORCIDAbstract
This submission formalizes Nguyen, Scott, and Seymour's proof that the five-vertex path has the Erdős–Hajnal property. It proves that there is a positive integer such that every finite graph with no induced copy of satisfies
The formalization follows the paper's blockade argument through polynomial semisparse blockades in house-free graphs, the sparse-house trichotomy and its iteration, and a final critical-graph argument. Density inequalities are stated over the natural numbers with denominators cleared. The development uses Rödl's theorem, sparse thinning, maximum-degree reduction, and the bipartite comb lemma from Lax 54; every argument specific to and its complement is proved in this submission.
Concepts
- thm✓
Lax57.AnticomponentBlockade - thm✓
Lax57.BlockadeThinning - thm✓
Lax57.ErdosHajnalP5 - def
Lax57.GraphDefinitions - thm✓
Lax57.HouseDichotomy - thm✓
Lax57.PreparedHouseBlockade - thm✓
Lax57.SemisparseBlockade - thm✓
Lax57.SparseHouseAcceleration - thm✓
Lax57.SparseHouseTools - thm✓
Lax57.SparseHouseTrichotomy
Concept map
Proofs
Proof networkview on GitHub
Lean sources for these proofs: proofs/ on GitHub
Proof code is not displayed; the archive records each proof's checked relationship between claims.
Related submissions
Submission map
Cite this
@misc{lax-57,
author = {Édouard Bonnet},
title = {Erdős–Hajnal for the five-vertex path},
year = {2026},
howpublished = {Lax Archive, lax-57},
url = {https://laxarchive.org/lax-57/},
note = {draft},
}
References
- Tung Nguyen, Alex Scott and Paul Seymour. Induced subgraph density. VII. The five-vertex path. 2026. arXiv:2312.15333
- Maria Chudnovsky, Alex Scott, Paul Seymour and Sophie Spirkl. Erdős–Hajnal for graphs with no 5-hole. Proceedings of the London Mathematical Society 126(3):997–1014, 2023. doi:10.1112/plms.12504
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