Cliques and the spectral radius (Q2642018): Difference between revisions

The authors prove several inequalities involving the largest eigenvalue \(\mu(G)\) of a graph \(G\) and the number \(k_s(G)\) of \(s\)-cliques of \(G\). For example, if \(G\) has \(n\) vertices and \(r\geq 2\), then \(k_{r+1}(G)\geq (\frac{\mu(G)}{n}-1+ \frac1r) \frac{r(r-1)}{r+1} (\frac nr)^{r+1}\).