The sum of degrees in cliques

MaRDI QIDQ2583673zbMATH OpenFDO

Authors Béla Bollobás, Vladimir Nikiforov

Publication date 17 January 2006

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0410218, https://eudml.org/doc/126456, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1n21.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Turán graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

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.

Recommendations

• Approximately counting cliques
• Cliques and the spectral radius
• Clique numbers of graphs
• On cliques in graphs
• The clique density theorem
• scientific article; zbMATH DE number 19181
• On the maximum number of cliques in a graph
• The number of cliques in graphs of given order and size
• On the sum of powers of the degrees of graphs
• Cliques in graphs with bounded minimum degree

Cited in

(8)

• Cliques in graphs with bounded minimum degree
• Convex hull of face vectors of colored complexes
• A refined Turán theorem
• Degree sum for a triangle in a graph
• Maximal chordal subgraphs
• Complete subgraphs with large degree sums
• Cliques in graphs with bounded minimum degree
• Joints in graphs

This page was built for publication: The sum of degrees in cliques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583673)