Turan's theorem inverted

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-07-23
dc.date2007-11-22
dc.date.accessioned2026-07-07T08:44:09Z
dc.date.available2026-07-07T08:44:09Z
dc.descriptionTuran'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.
dc.descriptionSome polishing. Updated references
dc.identifierhttps://arxiv.org/abs/0707.3394
dc.identifierhttp://arxiv.org/abs/0707.3394
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142558
dc.subjectCombinatorics
dc.subject05C35
dc.titleTuran's theorem inverted
dc.typetext

Files

Collections

arXiv