On the chromatic number of random regular hypergraphs

DOI10.1137/22M1544476MaRDI QIDQ6422167zbMATH OpenOpenAlexFDO

Authors Patrick Bennett, Alan Frieze

Publication date 30 December 2022

Full work available at URL https://doi.org/10.1137/22m1544476

Mathematics Subject Classification ID

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

Abstract: We estimate the likely values of the chromatic and independence numbers of the random $r$-uniform $d$-regular hypergraph on $n$ vertices for fixed $r$, large fixed $d$, and $nightarrowinfty$.

This page was built for publication: On the chromatic number of random regular hypergraphs

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