The set chromatic number of random graphs

DOI10.1016/J.DAM.2016.07.011zbMATH Open1346.05267arXiv1502.01295OpenAlexW1517912555MaRDI QIDQ323038FDOQ323038

Authors: D. Mitsche, Paweł Prałat, Andrzej Dudek 

Publication date: 7 October 2016

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

Abstract: In this paper we study the set chromatic number of a random graph $G(n,p)$ for a wide range of $p=p(n)$. We show that the set chromatic number, as a function of $p$, forms an intriguing zigzag shape.

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

Recommendations

• On the Chromatic Number of Random Graphs
• On the chromatic number of random graphs
• On the chromatic number of random graphs
• The chromatic number of random graphs
• The two possible values of the chromatic number of a random graph

zbMATH Keywords

random graphsset chromatic number

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• New versions of Suen's correlation inequality
• A tight bound on the set chromatic number
• Set colorings in perfect graphs.
• The set chromatic number of a graph
• The chromatic number of random graphs
• On the chromatic number of random graphs

Cited In (3)

• The two possible values of the chromatic number of a random graph
• The chromatic number of random graphs
• Visible lattice points and the chromatic zeta function of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323038)