An asymptotic upper bound for the chromatic index of random hypergraphs

DOI10.1515/DMA.2011.028zbMATH Open1237.05068OpenAlexW1989490148MaRDI QIDQ3225909

Yu. A. Budnikov

Publication date: 23 March 2012

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2011.028

zbMATH Keywords

random packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Asymptotic behavior of the chromatic index for hypergraphs

This page was built for publication: An asymptotic upper bound for the chromatic index of random hypergraphs