The set chromatic number of random graphs

preprint2015arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

The set chromatic number of random graphs

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0