2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/72810We investigate lower bounds on the average degree in r-cliques in graphs of order n and size greater than t(r,n), where t(r,n) is the size of the Turan graph on n vertices and r color classes. Continuing earlier research of Edwards and Faudree, we completely prove a conjecture of Bollobas and Erdoes from 1975.10 pagesCombinatorics05C35The sum of degrees in cliquestext