Publication:4705318
From MaRDI portal
DOI<381::AID-RSA5>3.0.CO;2-P 10.1002/(SICI)1098-2418(199807)12:4<381::AID-RSA5>3.0.CO;2-PzbMath0959.05110MaRDI QIDQ4705318
Michael Krivelevich, Benjamin Sudakov
Publication date: 19 December 1999
05C80: Random graphs (graph-theoretic aspects)
05C65: Hypergraphs
05C15: Coloring of graphs and hypergraphs
Related Items
Phase transitions in theq-coloring of random hypergraphs, On the Independence Number of Steiner Systems, On Two Limit Values of the Chromatic Number of a Random Hypergraph, Two-Colorings of a Random Hypergraph, On the concentration of values of \(j\)-chromatic numbers of random hypergraphs, On the chromatic number in the stochastic block model, Bounds on threshold probabilities for coloring properties of random hypergraphs, Large monochromatic components in 3‐edge‐colored Steiner triple systems, Chromatic numbers of simplicial manifolds, Information-theoretic thresholds from the cavity method, Independence numbers of random sparse hypergraphs, Choosability in random hypergraphs, On the strong chromatic number of random hypergraphs, Spectrum of signless 1-Laplacian on simplicial complexes, Estimating the \(r\)-colorability threshold for a random hypergraph, General independence sets in random strongly sparse hypergraphs, On the strong chromatic number of a random 3-uniform hypergraph, On the chromatic numbers of random hypergraphs, On the weak chromatic number of random hypergraphs, The theta number of simplicial complexes, On the chromatic number of a random hypergraph, On the concentration of the chromatic number of a random hypergraph, Colorings of partial Steiner systems and their applications, On the \(s\)-colorful number of a random hypergraph, On the concentration of the independence numbers of random hypergraphs, Estimating the strong \(r\)-colorability threshold in random hypergraphs
