Triangle-free Subgraphs at the Triangle-Free Process

Details Triangle-free Subgraphs at the Triangle-Free Process Triangle-free Subgraphs at the Triangle-Free Process

2009-03-10

arxiv.org/abs/0903.1756v5

Mathematics

Combinatorics

26 pages. Title change from "4-Cycles at the Triangle-Free Process". Results generalized. Other revisions

Scientific paper

We consider the triangle-free process: given an integer n, start by taking a uniformly random ordering of the edges of the complete n-vertex graph K_n. Then, traverse the ordered edges and add each traversed edge to an (initially empty) evolving graph - unless its addition creates a triangle. We study the evolving graph at around the time where \Theta(n^{3/2 + \epsilon}) edges have been traversed for any fixed \epsilon \in (0,10^{-10}). At that time and for any fixed triangle-free graph F, we give an asymptotically tight estimation of the expected number of copies of F in the evolving graph. For F that is balanced and have density smaller than 2 (e.g., for F that is a cycle of length at least 4), our argument also gives a tight concentration result for the number of copies of F in the evolving graph. Our analysis combines Spencer's original branching process approach for analysing the triangle-free process and the semi-random method.

Affiliated with

Also associated with

No associations

Rating

Triangle-free Subgraphs at the Triangle-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 Triangle-free Subgraphs at the Triangle-Free Process, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Triangle-free Subgraphs at the Triangle-Free Process will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187144