Joints in graphs

DOI10.1016/J.DISC.2007.03.045MaRDI QIDQ6474554arXivFDO

Authors Béla Bollobás, Vladimir Nikiforov

Publication date 7 October 2004

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DISC.2007.03.045

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

arXiv classification

math.CO

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 page was built for publication: Joints in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6474554)