2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/72809In 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.13 pagesCombinatorics05C35text