Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
Abstract Considering a natural generalization of the Ruzsa–Szemerédi problem, we prove that for any fixed positive integers r , s with r < s , there are graphs on n vertices containing $n^{r}e^{-O\left(\sqrt{\log{n}}\right)}=n^{r-o(1)}$ copies of K s such that any K r is contained in at most one K s …