An asymptotic upper bound for the chromatic index of random hypergraphs

DOI10.1515/DMA.2011.028MaRDI QIDQ3225909zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On the chromatic index of random uniform hypergraphs
• On the chromatic numbers of random hypergraphs
• On the chromatic number of a random hypergraph
• Asymptotic behavior of the chromatic index for hypergraphs
• Asymptotically good list-colorings

Cites work

• Asymptotic behavior of the chromatic index for hypergraphs

Cited in

(1)

• On the chromatic index of random uniform hypergraphs

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

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