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

DOI10.1112/PLMS.70011MaRDI QIDQ6659522FDOQ6659522

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

Publication date: 9 January 2025

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

zbMATH Keywords

Erdős-Faber-Lovász conjectureedge-colouring hypergraphs with bounded codegree

Mathematics Subject Classification ID

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

Cites Work

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

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)