@article{8d69edc2468f485194509f3d2dd78cf4,
title = "A proof of the Erd{\H o}s—Faber—Lov{\'a}sz conjecture",
abstract = "The Erd{\H o}s—Faber—Lov{\'a}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.",
keywords = "absorption AMS Classification: Primary: 05C15, 05C65, 05D40, chromatic index, graph coloring, hypergraph edge coloring, nibble",
author = "Kang, {Dong Yeap} and Tom Kelly and Daniela K{\"u}hn and Abhishek Methuku and Deryk Osthus",
note = "Keywords: graph coloring, hypergraph edge coloring, chromatic index, nibble, absorption AMS Classification: Primary: 05C15, 05C65, 05D40. This project has received partial funding from the European Research Council (ERC) under the European Union{\textquoteright}s Horizon 2020 research and innovation programme (grant agreement no. 786198, D. K{\"u}hn and D. Osthus). The research leading to these results was also partially supported by the EPSRC, grant nos. EP/N019504/1 (D. Kang, T. Kelly and D. K{\"u}hn) and EP/S00100X/1 (A. Methuku and D. Osthus). {\textcopyright} 2023 Department of Mathematics, Princeton University.",
year = "2023",
doi = "10.4007/annals.2023.198.2.2",
language = "English (US)",
volume = "198",
pages = "537--618",
journal = "Annals of Mathematics",
issn = "0003-486X",
publisher = "Department of Mathematics at Princeton University",
number = "2",
}