Joints in graphs
classification
🧮 math.CO
keywords
bounderdoesgraphsclassescliquescoloredgeedges
read the original abstract
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.
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.