|
|||||
|
|
Graphs with many r-cliques have large complete r-partite subgraphs |
|
| Authors: | Nikiforov Vladimir |
| Affiliation: | Department of Mathematical Sciences University of Memphis Memphis TN 38152 USA |
| Abstract: | Let r  2 and c>0. Every graph on n vertices with at least cnrcliques on r vertices contains a complete r-partite subgraphwith r–1 parts of size  crlog n and one part of size greaterthan n1–cr–1. This result implies a quantitativeform of the Erdös–Stone theorem. |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ | |