Large joints in graphs

作者：Bollobas Bela^*; Nikiforov Vladimir

来源：European Journal of Combinatorics, 2011, 32(1): 33-44.

DOI：10.1016/j.ejc.2010.07.010

We show that if r >= s >= 2, n > r(8), and G is a graph of order n containing as many r-cliques as the r-partite Turan graph of order n, then G has more than n(r-1)/r(2r+12) cliques sharing a common edge unless G is isomorphic to the r-partite Turin graph of order n. This structural result generalizes a previous result that has been useful in extremal graph theory.

• 出版日期2011-1