Graphs with many r -cliques have large complete r -partite subgraphs
Work
Year: 2008
Type: article
Abstract: Let r⩾2 and c>0. Every graph on n vertices with at least cnr cliques on r vertices contains a complete r-partite subgraph with r−1 parts of size ⌊ crlog n⌋ and one part of size greater than n 1 − c r ... more
Author Vladimir Nikiforov
Institution University of Memphis
Cites: 11
Cited by: 34
Related to: 10
FWCI: 6.213
Citation percentile (by year/subfield): 93.71
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green