Maximising $K_{s}$ in a $K_m$ free graph

37 Views Asked by At

A graph $G$ on $n$ vertices does not contain a $K_{m}$ (complete subgraph with $m$ vertex). What is the maximum number of $K_{s}$ ($s<m$) in $G$, taken as a function of $s$, $n$, and $m$?

1

There are 1 best solutions below

0
On BEST ANSWER

Well I have found this article which answers this problem in Theorem one and includes a proof in appendix A. hope you enjoy.