The set chromatic number of random graphs

DOI10.1016/J.DAM.2016.07.011MaRDI QIDQ323038zbMATH OpenOpenAlexFDO

Authors D. 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

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

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.

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

Cites work

• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• A tight bound on the set chromatic number
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• New versions of Suen's correlation inequality
• On the chromatic number of random graphs
• Set colorings in perfect graphs.
• The chromatic number of random graphs
• The set chromatic number of a graph

Cited in

(4)

• Visible lattice points and the chromatic zeta function of a graph
• The two possible values of the chromatic number of a random graph
• The chromatic number of random graphs
• Set colorings of the Cartesian product of some graph families

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)