Multigraphs (only) satisfy a weak triangle removal lemma

Details Multigraphs (only) satisfy a weak triangle removal lemma Multigraphs (only) satisfy a weak triangle removal lemma

2009-02-03

arxiv.org/abs/0902.0580v1

Mathematics

Combinatorics

Scientific paper

The triangle removal lemma states that a simple graph with o(n^3) triangles can be made triangle-free by removing o(n^2) edges. It is natural to ask if this widely used result can be extended to multi-graphs (or equivalently, weighted graphs). In this short paper we rule out the possibility of such an extension by showing that there are multi-graphs with only n^{2+o(1)} triangles that are still far from being triangle-free. On the other hand, we show that for some g(n)=\omega(1), if a multi-graph (or weighted graph) has only g(n)n^2 triangles then it must be close to being triangle-free. The proof relies on variants of the Ruzsa-Szemer\'edi theorem.

Affiliated with

Also associated with

No associations

Rating

Multigraphs (only) satisfy a weak triangle 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 Multigraphs (only) satisfy a weak triangle removal lemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multigraphs (only) satisfy a weak triangle removal lemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-298103