Mathematics – Combinatorics
Scientific paper
2010-01-13
Mathematics
Combinatorics
9 pages
Scientific paper
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.
Bollobas Bela
Nikiforov Vladimir
No associations
LandOfFree
Large joints in graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Large joints in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large joints in graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-524712