A proof of the Erdős-Faber-Lovász conjecture
Abstract
The Erdős-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on $n$ vertices is at most $n$. In this paper, we prove this conjecture for every large $n$. We also provide stability versions of this result, which confirm a prediction of Kahn.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2021
- DOI:
- 10.48550/arXiv.2101.04698
- arXiv:
- arXiv:2101.04698
- Bibcode:
- 2021arXiv210104698Y
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 47 pages, 3 figures. Final version, to appear in the Annals of Mathematics