Conflict-free coloring of graphs

Roman Glebov, Tibor Szabó, Gábor Tardos

We study the conflict-free chromatic number chi_{CF} of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-fr…