Mathematics – Combinatorics
Scientific paper
2004-10-08
Mathematics
Combinatorics
13 pages
Scientific paper
In 1969 Erdoes found a lower bound on the number of (r+1)-cliques sharing an
edge in graphs with n vertices and t(r,n)+1 edges, where t(r,n) is the size of
the Turan graph of order n and r color classes. We improve Erdoes's bound and
prove a related stability result.
Bollobas Bela
Nikiforov Vladimir
No associations
LandOfFree
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 Joints in graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joints in graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-316595