English

The set chromatic number of random graphs

Combinatorics 2015-02-05 v1 Probability

Abstract

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

Keywords

Cite

@article{arxiv.1502.01295,
  title  = {The set chromatic number of random graphs},
  author = {Andrzej Dudek and Dieter Mitsche and Paweł Prałat},
  journal= {arXiv preprint arXiv:1502.01295},
  year   = {2015}
}
R2 v1 2026-06-22T08:22:21.959Z