Conflict-free coloring of graphs

Details Conflict-free coloring of graphs Conflict-free coloring of graphs

2011-11-23

arxiv.org/abs/1111.5501v1

Mathematics

Combinatorics

12 pages

Scientific paper

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-free chromatic number an n-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\H{o}s-R\'enyi random graph G(n,p) and give the asymptotics for p=omega(1/n). We also show that for p \geq 1/2 the conflict-free chromatic number differs from the domination number by at most 3.

Affiliated with

Also associated with

No associations

Rating

Conflict-free coloring of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conflict-free coloring of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conflict-free coloring of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-377277