Complete subgraphs with large degree sums

DOI10.1002/JGT.3190160406MaRDI QIDQ4014272zbMATH OpenOpenAlexFDO

Authors Ralph Faudree

Publication date 5 October 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160406

zbMATH Keywords

chromatic numberscomplete subgraphsdegree sumslower boundTurán's theoremupper bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 3188526
• The sum of degrees in cliques
• scientific article; zbMATH DE number 1076140
• Bounds on the number of complete subgraphs
• scientific article; zbMATH DE number 3819765

Cited in

(7)

• Subgraphs with large degrees and girth
• Bounds on the number of complete subgraphs
• Extremal problems and generalized degrees
• Greedy clique decompositions and the Turán numbers
• Fractional Turan's theorem and bounds for the chromatic number
• scientific article; zbMATH DE number 3941573 (Why is no real title available?)
• Maximal chordal subgraphs

This page was built for publication: Complete subgraphs with large degree sums

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