Joints in graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-316595

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.