A new proof of the graph removal lemma

Details A new proof of the graph removal lemma A new proof of the graph removal lemma

2010-06-07

arxiv.org/abs/1006.1300v2

Mathematics

Combinatorics

17 pages

Scientific paper

Let H be a fixed graph with h vertices. The graph removal lemma states that every graph on n vertices with o(n^h) copies of H can be made H-free by removing o(n^2) edges. We give a new proof which avoids Szemer\'edi's regularity lemma and gives a better bound. This approach also works to give improved bounds for the directed and multicolored analogues of the graph removal lemma. This answers questions of Alon and Gowers.

Affiliated with

Also associated with

No associations

Rating

A new proof of the graph removal lemma 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 A new proof of the graph removal lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new proof of the graph removal lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367504