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

DOI10.4007/annals.2023.198.2.2zbMath1520.05036arXiv2101.04698OpenAlexW3168462725WikidataQ122936845 ScholiaQ122936845MaRDI QIDQ6093285

Deryk Osthus, Daniela Kühn, Dong Kang, Abhishek Methuku, Tom Kelly

Publication date: 6 September 2023

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.04698

zbMATH Keywords

graph coloringabsorptionchromatic indexhypergraph edge coloringnibble

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Graph and hypergraph colouring via nibble methods: a survey ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• The chromatic index of simple hypergraphs
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• A note on Ramsey numbers
• Extremal uncrowded hypergraphs
• On the combinatorial problems which I would most like to see solved
• Packing nearly-disjoint sets
• Vertex coverings by monochromatic cycles and trees
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• A fractional version of the Erdős-Faber-Lovász conjecture
• Coloring graphs with sparse neighborhoods
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Connected components in random graphs with given expected degree sequences
• Asymptotically good list-colorings
• Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
• Colouring graphs with sparse neighbourhoods: bounds and applications
• On a hypergraph matching problem
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• Triangle Factors in Random Graphs
• Near-optimal list colorings
• A Stronger Bound for the Strong Chromatic Index
• The Ramsey number R(3, t) has order of magnitude t²/log t
• On Brooks' Theorem for Sparse Graphs
• Pseudorandom hypergraph matchings
• Edge‐coloring linear hypergraphs with medium‐sized edges
• Two Chromatic Conjectures: One for Vertices and One for Edges
• Subgraphs with prescribed valencies
• The Factorization of Linear Graphs
• Optimal path and cycle decompositions of dense quasirandom graphs
• Graph colouring and the probabilistic method

This page was built for publication: A proof of the Erdős-Faber-Lovász conjecture