A proof of the Erdős--Faber--Lovász conjecture

IF 5.7 1区数学 Q1 MATHEMATICS

Annals of Mathematics Pub Date : 2023-09-01 DOI:10.4007/annals.2023.198.2.2

D. Kang, T. Kelly, Daniela Kühn, Abhishek Methuku, D. Osthus

引用次数: 6

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.

查看原文本刊更多论文

Erdős—费伯—Lovász猜想的证明

Erdõs-Faber-Lovász猜想（1972年提出）指出，任何线性超图在n个顶点上的色指数最多为n。在本文中，我们对每个大的n证明了这个猜想。我们还提供了这个结果的稳定性版本，证实了Kahn的一个预测。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Annals of Mathematics 数学-数学

CiteScore

9.10

自引率

2.00%

发文量

审稿时长

12 months

期刊介绍： The Annals of Mathematics is published bimonthly by the Department of Mathematics at Princeton University with the cooperation of the Institute for Advanced Study. Founded in 1884 by Ormond Stone of the University of Virginia, the journal was transferred in 1899 to Harvard University, and in 1911 to Princeton University. Since 1933, the Annals has been edited jointly by Princeton University and the Institute for Advanced Study.