The sum of degrees in cliques

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

For every graph G, let Δr (G) = max{∑ uεRd (u) : R is an r-clique of G} and let Δr (n, m) be the minimum of Δr (G) taken over all graphs of order n and size m. Write tr (n) for the size of the r-chromatic Turán graph of order n. Improving earlier results of Edwards and Faudree, we show that for every r ≥ 2; if m ≥ tr (n), then Δr (n, m) ≥ 2rm/n; as conjectured by Bollobás and Erdos. It is known that inequality (1) fails for m < tr (n). However, we show that for every ε > 0, there is δ > 0 such that if m > tr (n) - δn2 then Δr (n, m) ≥ (1 - ε) 2rm/n.

Cite

CITATION STYLE

APA

Bollobás, B., & Nikiforov, V. (2005). The sum of degrees in cliques. Electronic Journal of Combinatorics, 12(1 N), 1–10. https://doi.org/10.37236/1988

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free