Conflict-Free Colouring of Graphs

We study the conflict-free chromatic number χCF of graphs from extremal and probabilistic points of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized. In relation to this we study the evolution o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorics, probability & computing probability & computing, 2014-05, Vol.23 (3), p.434-448
Hauptverfasser:	GLEBOV, ROMAN, SZABÓ, TIBOR, TARDOS, GÁBOR
Format:	Artikel
Sprache:	eng
Schlagworte:	Asymptotic properties Colouring Combinatorial analysis Construction Evolution Graphs Probabilistic methods Probability theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!