论文信息 - Bounds on the number of complete subgraphs

Bounds on the number of complete subgraphs

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

Jennifer Ryan | David C. Fisher | J. Ryan

[1] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[2] Norbert Sauer. A generalization of a theorem of Turán , 1971 .

[3] E. A. Nordhaus,et al. Triangles in an Ordinary Graph , 1963, Canadian Journal of Mathematics.

[4] David C. Fisher. The number of triangles in a K4-free graph , 1988, Discret. Math..

[5] Pál Erdös. On the number of complete subgraphs and circuits contained in graphs , 1969 .

[6] P. Turán. On the theory of graphs , 1954 .

[7] David C. Fisher. Lower bounds on the number of triangles in a graph , 1989, J. Graph Theory.