Bounds on the number of complete subgraphs

DOI10.1016/0012-365X(92)90323-8zbMath0817.05035OpenAlexW2074614998MaRDI QIDQ1195482

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 numberTurán's theoremnumber of complete subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• The number of triangles in a \(K_ 4\)-free graph
• 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
• Triangles in an Ordinary Graph
• On the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

Related Items (17)

Tree densities in sparse graph classes ⋮ On the location of roots of independence polynomials ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ Independent set and matching permutations ⋮ Many triangles with few edges ⋮ Localised graph Maclaurin inequalities ⋮ Induced Turán Numbers ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ The feasible region of hypergraphs ⋮ Unnamed Item ⋮ A note on Turán's theorem ⋮ On the maximum number of cliques in a graph ⋮ New short proofs to some stability theorems ⋮ On clique values identities and mantel-type theorems ⋮ On the independent set sequence of a tree ⋮ Roots of independence polynomials of well covered graphs ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem

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