On the weak chromatic number of random hypergraphs

DOI10.1016/J.DAM.2019.03.025zbMath1435.05182OpenAlexW2937284973WikidataQ128038379 ScholiaQ128038379MaRDI QIDQ2309562

Aleksandr S. Semenov, Dmitriy A. Shabanov

Publication date: 1 April 2020

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

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

zbMATH Keywords

chromatic numberscoloringsrandom hypergraphs

Mathematics Subject Classification ID

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

Related Items (11)

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 ⋮ 2-colorings of hypergraphs with large girth ⋮ Bounds on threshold probabilities for coloring properties of random hypergraphs ⋮ On the concentration of the independence numbers of random hypergraphs ⋮ On the strong chromatic number of a random 3-uniform hypergraph ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites Work

• Unnamed Item
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• On the number of independent sets in simple hypergraphs
• General independence sets in random strongly sparse hypergraphs
• On the chromatic number of a random hypergraph
• On the concentration of the chromatic number of a random hypergraph
• Panchromatic 3-colorings of random hypergraphs
• Sharp thresholds for constraint satisfaction problems and homomorphisms
• Random hypergraph coloring algorithms and the weak chromatic number
• Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
• The chromatic number of dense random graphs
• Hypergraph Independent Sets
• Hypergraph coloring up to condensation

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