Estimating the \(r\)-colorability threshold for a random hypergraph

DOI10.1016/j.dam.2019.10.031zbMath1442.05070OpenAlexW2983515507MaRDI QIDQ2185741

Dmitriy A. Shabanov

Publication date: 5 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.10.031

zbMATH Keywords

coloringsrandom hypergraphsecond moment methodprobability thresholds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

On the maximal cut in a random hypergraph ⋮ On the strong chromatic number of random hypergraphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ On the concentration of values of \(j\)-chromatic numbers of random hypergraphs ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ Estimating the strong \(r\)-colorability threshold in random hypergraphs ⋮ On the strong chromatic number of a random 3-uniform hypergraph

Cites Work

• Unnamed Item
• Unnamed Item
• On random subgraphs of Kneser and Schrijver graphs
• On chromatic numbers of nearly Kneser distance graphs
• Upper-bounding the \(k\)-colorability threshold by counting covers
• Random Kneser graphs and hypergraphs
• On the chromatic number of a random subgraph of the Kneser graph
• On the chromatic number of random graphs
• A note on the sharp concentration of the chromatic number of random graphs
• Chromatic number of random Kneser hypergraphs
• On the chromatic number of a random hypergraph
• Panchromatic 3-colorings of random hypergraphs
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• On the 2-colorability of random hypergraphs
• Two‐coloring random hypergraphs
• The Chromatic Number of Random Graphs for Most Average Degrees
• The chromatic number of dense random graphs
• Hypergraph coloring up to condensation
• Rigid Colorings of Hypergraphs and Contiguity
• On panchromatic colourings of a random hypergraph
• Two-Colorings of a Random Hypergraph
• The condensation transition in random hypergraph 2-coloring
• The chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph
• The condensation phase transition in random graph coloring

This page was built for publication: Estimating the \(r\)-colorability threshold for a random hypergraph