Bounds on the number of complete subgraphs

DOI10.1016/0012-365X(92)90323-8MaRDI QIDQ1195482zbMATH OpenOpenAlexFDO

Authors David C. Fisher, Jennifer K. Ryan

Publication date 6 December 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90323-8

zbMATH Keywords

boundclique numbernumber of complete subgraphsTurán's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 3188526
• scientific article; zbMATH DE number 4200235
• An upper bound on the number of cliques in a graph
• A new Turán-type theorem for cliques in graphs
• Complete subgraphs with large degree sums

Cites work

• scientific article; zbMATH DE number 4148120 (Why is no real title available?)
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• A generalization of a theorem of Turán
• Lower bounds on the number of triangles in a graph
• On the number of complete subgraphs and circuits contained in graphs
• On the theory of graphs
• The number of triangles in a \(K_ 4\)-free graph
• Triangles in an Ordinary Graph

Cited in

(26)

• Handle bases and bounds on the number of subgraphs
• Independent set and matching permutations
• The feasible region of hypergraphs
• On the location of roots of independence polynomials
• On the maximum number of copies of H in graphs with given size and order
• Many triangles with few edges
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• Roots of independence polynomials of well covered graphs
• Induced Turán numbers
• A Remark on the Number of Complete and Empty Subgraphs
• On the independent set sequence of a tree
• Tree densities in sparse graph classes
• Complete subgraphs with large degree sums
• New short proofs to some stability theorems
• Localised graph Maclaurin inequalities
• scientific article; zbMATH DE number 4160792 (Why is no real title available?)
• Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds
• Complete subgraphs in connected graphs and its application to spectral moment
• A Kruskal-Katona type theorem for graphs
• On the maximum number of cliques in a graph
• scientific article; zbMATH DE number 3941573 (Why is no real title available?)
• The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
• Bounds for the number of mappings of graphs and for the number of subgraphs
• A note on Turán's theorem
• New exact values of the maximum size of graphs free of topological complete subgraphs
• On clique values identities and Mantel-type theorems

This page was built for publication: Bounds on the number of complete subgraphs

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