On the \(s\)-colorful number of a random hypergraph

DOI10.1007/s10958-021-05327-0zbMath1461.05150OpenAlexW3138030131MaRDI QIDQ2662926

Dmitriy A. Shabanov

Publication date: 15 April 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05327-0

zbMATH Keywords

binomial model\(s\)-colorful coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number
• 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
• The existence of panchromatic colourings for uniform hypergraphs
• Random hypergraph coloring algorithms and the weak chromatic number

This page was built for publication: On the \(s\)-colorful number of a random hypergraph