The sum of degrees in cliques

zbMATH Open1097.05022arXivmath/0410218MaRDI QIDQ2583673FDOQ2583673

Authors: Béla Bollobás, Vladimir Nikiforov 

Publication date: 17 January 2006

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

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.

Full work available at URL: https://arxiv.org/abs/math/0410218

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

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

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+graph&go=Go Tur��n graph]

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (8)

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

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)