Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree

DOI10.1112/PLMS.70011MaRDI QIDQ6659522zbMATH OpenFDO

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

Publication date 9 January 2025

Published in Proceedings of the London Mathematical Society. Third Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/PLMS.70011

zbMATH Keywords

edge-colouring hypergraphs with bounded codegreeErdős-Faber-Lovász conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• Chromatic index of simple hypergraphs
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture for dense hypergraphs

Cites work

• A bound on the strong chromatic index of a graph
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• A fractional version of the Erdős-Faber-Lovász conjecture
• A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
• A local epsilon version of Reed's conjecture
• A proof of the Erdős-Faber-Lovász conjecture
• A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree
• A stronger bound for the strong chromatic index
• Asymptotically good list-colorings
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Finite geometry and combinatorial applications
• Graph and hypergraph colouring via nibble methods: a survey
• Graph colouring and the probabilistic method
• Graph Theory and Probability
• scientific article; zbMATH DE number 3715594 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1286500 (Why is no real title available?)
• scientific article; zbMATH DE number 898011 (Why is no real title available?)
• Open problems of Paul Erd�s in graph theory
• The chromatic index of simple hypergraphs
• The Nonexistence of Certain Finite Projective Planes

This page was built for publication: Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659522)