A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)(2022)
摘要
The Erdos-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on $n$ vertices is at most n. Erdö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.
更多查看译文
关键词
Hypergraph colouring, Rodl nibble, Erdos-Faber-Lovasz
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要