The sum of degrees in cliques

Simple item page
dc.creatorBollobas, B.
dc.creatorNikiforov, V.
dc.date2004-10-08
dc.date.accessioned2026-07-07T05:13:04Z
dc.date.available2026-07-07T05:13:04Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0410218
dc.identifierhttp://arxiv.org/abs/math/0410218
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72810
dc.subjectCombinatorics
dc.subject05C35
dc.titleThe sum of degrees in cliques
dc.typetext

Files

Collections

arXiv