@inproceedings{c8a9c18770224aaba0813f14aed4dabb,
title = "A proof of the Erd{\"o}s-Faber-Lov{\'a}sz conjecture: Algorithmic aspects",
abstract = "The Erdos-Faber-Lov{\'a}sz conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on n vertices is at most n. Erd{\"o}s considered this to be one of his three most favorite combinatorial problems and offered a 500 reward for a proof of this conjecture. We prove this conjecture for every large n. Here, we also provide a randomised algorithm to find such a colouring in polynomial time with high probability.",
keywords = "Erd{\"o}s-Faber-Lov{\'a}sz, Hypergraph colouring, R{\"o}dl nibble",
author = "Kang, {Dong Yeap} and Tom Kelly and Daniela Kuhn and Abhishek Methuku and Deryk Osthus",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 ; Conference date: 07-02-2022 Through 10-02-2022",
year = "2022",
doi = "10.1109/FOCS52979.2021.00107",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "1080--1089",
booktitle = "Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021",
address = "United States",
}