Bounds on the number of complete subgraphs

Authors:
David C. Fisher;Jennifer Ryan
Affiliations:
-;-
Venue:
Discrete Mathematics
Year:
1992

Citing 0
Cited 3

Roots of Independence Polynomials of Well Covered Graphs

Journal of Algebraic Combinatorics: An International Journal
Some Inequalities for the Largest Eigenvalue of a Graph

Combinatorics, Probability and Computing
On the Location of Roots of Independence Polynomials

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.05

Visualization

Abstract

Let G be a graph with a clique number w. For 1jw, let kj be thenumber of complete subgraphs on j nodes. We show that . This isexact for complete balanced w-partite graphs and gives Turantheorem when j = 1. A coronally is w(8k329k23+3k316k32+9k23)/(4k3218k23. This new bound on the cliquenumber supercedes an earlier bound from Turan's theorem.