Lower Bounds for the Size of Random Maximal H-Free Graphs

Details Lower Bounds for the Size of Random Maximal H-Free Graphs Lower Bounds for the Size of Random Maximal H-Free Graphs

2008-05-12

arxiv.org/abs/0805.1747v4

Electron. J. Combin. 16 (2009), no. 1, Research Paper 4, 26 pp

Mathematics

Combinatorics

27 pages. This is the final journal version + errata

Scientific paper

We consider the next greedy randomized process for generating maximal H-free graphs: Given a fixed graph H and an integer n, start by taking a uniformly random permutation of the edges of the complete n-vertex graph. Then, construct an n-vertex graph, M_n(H), iteratively as follows. Traverse the permuted edges of the complete n-vertex graph and add each one to the (initially empty) evolving graph M_n(H) - unless its addition creates a copy of H. The result of this process is a maximal H-free graph M_n(H). The basic question we are concerned with in here is: What is the expected number of edges in M_n(H)? We give new lower bounds on the expected number of edges in M_n(H) for the case where H is a regular, strictly 2-balanced graph. In particular, we obtain new lower bounds for Turan numbers of complete balanced bipartite graphs K_{r,r}, for every fixed r > 4. This improves an old lower bound of Erdos and Spencer.

Affiliated with

Also associated with

No associations

Rating

Lower Bounds for the Size of Random Maximal H-Free 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 Lower Bounds for the Size of Random Maximal H-Free Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for the Size of Random Maximal H-Free Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471773