pith. sign in

arxiv: 1001.2073 · v1 · submitted 2010-01-13 · 🧮 math.CO

Large joints in graphs

classification 🧮 math.CO
keywords graphorderlarger-partiteresultturanbeencliques
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.