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.
Citation
Dong Kang. Tom Kelly. Daniela Kühn. Abhishek Methuku. Deryk Osthus. "A proof of the Erdős--Faber--Lovász conjecture." Ann. of Math. (2) 198 (2) 537 - 618, September 2023. https://doi.org/10.4007/annals.2023.198.2.2
Information
