Hypergraph coloring up to condensation
From MaRDI portal
Publication:5229334
DOI10.1002/rsa.20824zbMath1417.05057arXiv1508.01841OpenAlexW2962850782WikidataQ128785617 ScholiaQ128785617MaRDI QIDQ5229334
Amin Coja-Oghlan, Peter Ayre, Catherine Greenhill
Publication date: 14 August 2019
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.01841
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items (16)
On the maximal cut in a random hypergraph ⋮ Waiter-client and client-waiter colourability and \(k\)-SAT games ⋮ On the strong chromatic number of random hypergraphs ⋮ On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ Estimating the \(r\)-colorability threshold for 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 ⋮ On a Connectivity Threshold for Colorings of Random Graphs and Hypergraphs ⋮ On the chromatic numbers of random hypergraphs ⋮ On the Potts antiferromagnet on random graphs ⋮ Equitable colorings of hypergraphs with few edges ⋮ On the weak chromatic number of random hypergraphs ⋮ The replica symmetric phase of random constraint satisfaction problems ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: Hypergraph coloring up to condensation
