The triangle-free process

Details The triangle-free process The triangle-free process

2008-06-26

arxiv.org/abs/0806.4375v1

Mathematics

Combinatorics

24 pages, 0 figures

Scientific paper

Consider the following stochastic graph process. We begin with the empty graph on n vertices and add edges one at a time, where each edge is chosen uniformly at random from the collection of potential edges that do not form triangles when added to the graph. The process terminates at a maximal traingle-free graph. Here we analyze the triangle-free process, determining the likely order of magnitude of the number of edges in the final graph. As a corollary we show that the triangle-free process is very likely to produce a Ramsey R(3,t) graph; that is, our analysis of the triangle-free process gives a new proof of the lower bound on R(3,t) previously established by Jeong Han Kim. The techniques introduced extend to the K_4-free process thereby establishing a small improvement in the best known lower bound on the Ramsey number R(4,t).

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-246827