Turan's theorem inverted
Combinatorics
2007-11-22 v2
Abstract
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.
Cite
@article{arxiv.0707.3394,
title = {Turan's theorem inverted},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0707.3394},
year = {2007}
}
Comments
Some polishing. Updated references