The set chromatic number of random graphs

DOI10.1016/j.dam.2016.07.011zbMath1346.05267arXiv1502.01295OpenAlexW1517912555MaRDI QIDQ323038

Dieter Mitsche, Paweł Prałat, Andrzej Dudek

Publication date: 7 October 2016

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

Full work available at URL: https://arxiv.org/abs/1502.01295

zbMATH Keywords

random graphsset chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A tight bound on the set chromatic number
• Set colorings in perfect graphs
• The set chromatic number of a graph
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• New versions of Suen's correlation inequality
• The chromatic number of random graphs
• On the chromatic number of random graphs

This page was built for publication: The set chromatic number of random graphs