The final size of the C_4-free process

Details The final size of the C_4-free process The final size of the C_4-free process

2010-10-25

arxiv.org/abs/1010.5208v1

Mathematics

Combinatorics

20 pages

Scientific paper

We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of C_4. We show that, with probability tending to 1 as $n \to \infty$, the final graph produced by this process has maximum degree O((n \log n)^{1/3}) and consequently size O(n^{4/3}\log(n)^{1/3}), which are sharp up to constants. This confirms conjectures of Bohman and Keevash and of Osthus and Taraz, and improves upon previous bounds due to Bollob\'as and Riordan and Osthus and Taraz.

Affiliated with

Also associated with

No associations

Rating

The final size of the C_4-free process 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 The final size of the C_4-free process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The final size of the C_4-free process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-94530