Turan's theorem inverted

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Some polishing. Updated references

Keywords

Combinatorics, 05C35

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142558

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.3394
 http://arxiv.org/abs/0707.3394

Collections

arXiv