Ramsey games with giants

Details Ramsey games with giants Ramsey games with giants

2009-07-31

arxiv.org/abs/0907.5590v2

Mathematics

Combinatorics

29 pages; minor revisions

Scientific paper

The classical result in the theory of random graphs, proved by Erdos and Renyi in 1960, concerns the threshold for the appearance of the giant component in the random graph process. We consider a variant of this problem, with a Ramsey flavor. Now, each random edge that arrives in the sequence of rounds must be colored with one of R colors. The goal can be either to create a giant component in every color class, or alternatively, to avoid it in every color. One can analyze the offline or online setting for this problem. In this paper, we consider all these variants and provide nontrivial upper and lower bounds; in certain cases (like online avoidance) the obtained bounds are asymptotically tight.

Affiliated with

Also associated with

No associations

Rating

Ramsey games with giants 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 Ramsey games with giants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ramsey games with giants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-268144