Graphs with many r-cliques have large complete r-partite subgraphs release_nounihyo75f37mnhxsdi7wz3mi

by Vladimir Nikiforov

Released as a article .

2007  

Abstract

We prove that for all r≥2 and c>0, every graph of order n with at least cn^r cliques of order r contains a complete r-partite graph with each part of size c^r n . This result implies a concise form of the Erdős-Stone theorem.
In text/plain format

Archived Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

"Dark" Preservation Only
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article
Stage   submitted
Date   2007-07-23
Version   v2
Language   en ?
arXiv  math/0703554v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d8bfe890-028f-4529-8bd0-6f2e0f31c995
API URL: JSON