Turan's theorem inverted

Details Turan's theorem inverted Turan's theorem inverted

2007-07-23

arxiv.org/abs/0707.3394v2

Mathematics

Combinatorics

Some polishing. Updated references

Scientific paper

Turan's theorem implies that every graph of order n with more edges than the
r-partite Turan graph contains a complete graph of order r+1. We show that the
same premise implies the existence of much larger graphs. We also prove
corresponding stability theorems. These results complete work started by Erdos
in 1963.

Affiliated with

Also associated with

No associations

Rating

Turan's theorem inverted 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 Turan's theorem inverted, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turan's theorem inverted will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-109844