Bounds on the number of complete subgraphs
From MaRDI portal
Publication:1195482
DOI10.1016/0012-365X(92)90323-8zbMATH Open0817.05035OpenAlexW2074614998MaRDI QIDQ1195482FDOQ1195482
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds on the number of triangles in a graph
- On the theory of graphs
- Triangles in an Ordinary Graph
- On the number of complete subgraphs and circuits contained in graphs
- A generalization of a theorem of Turán
- The number of triangles in a \(K_ 4\)-free graph
- Title not available (Why is that?)
Cited In (26)
- Independent set and matching permutations
- Handle bases and bounds on the number of subgraphs
- On the maximum number of copies of H in graphs with given size and order
- The feasible region of hypergraphs
- Many triangles with few edges
- On the location of roots of independence polynomials
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Induced Turán numbers
- Roots of independence polynomials of well covered graphs
- A Remark on the Number of Complete and Empty Subgraphs
- Tree densities in sparse graph classes
- On the independent set sequence of a tree
- Localised graph Maclaurin inequalities
- Complete subgraphs with large degree sums
- New short proofs to some stability theorems
- Title not available (Why is that?)
- Complete subgraphs in connected graphs and its application to spectral moment
- Complete subgraphs of the coprime hypergraph of integers. I: Introduction and bounds
- A Kruskal-Katona type theorem for graphs
- On the maximum number of cliques in a graph
- Title not available (Why is that?)
- 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
- On clique values identities and Mantel-type theorems
- New exact values of the maximum size of graphs free of topological complete subgraphs
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)
