Author:
GLEBOV ROMAN,SZABÓ TIBOR,TARDOS GÁBOR
Abstract
We study the conflict-free chromatic number χCFof graphs from extremal and probabilistic points of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number ann-vertex graph can have. Our construction is randomized. In relation to this we study the evolution of the conflict-free chromatic number of the Erdős–Rényi random graphG(n,p) and give the asymptotics forp= ω(1/n). We also show that forp≥ 1/2 the conflict-free chromatic number differs from the domination number by at most 3.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference11 articles.
1. Bar-Yehuda R. , Goldreich O. and Itai A. (1986) On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization. In Proc. 4th ACM Symposium on Principles of Distributed Computing, pp. 98–107.
2. On the domination number of a random graph;Wieland;Electron. J. Combin.,2001
3. Size and connectivity of the k-core of a random graph
4. Random Graphs
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献