Large joints in graphs
Combinatorics
2010-01-14 v1
Abstract
We show that if G is a graph of sufficiently large order n containing as many r-cliques as the r-partite Turan graph of order n; then for some C>0 G has more than Cn^(r-1) (r+1)-cliques sharing a common edge unless G is isomorphic to the the r-partite Turan graph of order n. This structural result generalizes a previous result that has been useful in extremal graph theory.
Keywords
Cite
@article{arxiv.1001.2073,
title = {Large joints in graphs},
author = {Bela Bollobas and Vladimir Nikiforov},
journal= {arXiv preprint arXiv:1001.2073},
year = {2010}
}
Comments
9 pages