The sum of degrees in cliques
Combinatorics
2007-05-23 v1
Abstract
We 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.
Cite
@article{arxiv.math/0410218,
title = {The sum of degrees in cliques},
author = {B. Bollobas and V. Nikiforov},
journal= {arXiv preprint arXiv:math/0410218},
year = {2007}
}
Comments
10 pages