Joints in graphs Original Research Article

In 1969 Erdős proved that if image and image, every graph G of order n and image has an edge that is contained in at least image cliques of order image. In this note we improve this bound to image. We also prove a corresponding stability result.