On the chromatic number of random regular hypergraphs

2022/12/31 by Patrick Bennett, Alan Frieze, Bennett, Patrick +1
Mathematics · #Chromatic scale #Combinatorics #Combinatorics (math.CO) #Discrete mathematics #FOS: Mathematics #Graph #Hypergraph #Independence (probability theory) #Independence number #Limits and Structures in Graph Theory #Mathematics #Statistics

paper · pdf · doi:10.48550/arxiv.2301.00085

published in arXiv (Cornell University) (Cornell University)

openalex publication_date 2022/12/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

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 n → ∞.

Related

• On the chromatic number of a random hypergraph
• On r-colorability of random hypergraphs
• The Chromatic Number of Random Regular Graphs
• On the chromatic number of random regular graphs
• A note on random greedy coloring of uniform hypergraphs