A proof of the Erdo?s-Faber-Lov'asz conjecture

Dong Yeap Kang,Tom Kelly,Daniela Kuhn,Abhishek Methuku,Deryk Osthus

ANNALS OF MATHEMATICS（2023）

引用 23|浏览1

暂无评分

摘要

The Erdo ?s-Faber-Lovasz 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.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要