Abstract
Erdős asked in 1962 about the value off(n,k,l), the minimum number ofk-cliques in a graph with ordernand independence number less thanl. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all largen) for (3,l) with 4 ≤l≤ 7 and (k,3) with 4 ≤k≤ 7. Independently, Das, Huang, Ma, Naves and Sudakov resolved the cases (k,l)=(3,4) and (4,3).

This publication has 15 references indexed in Scilit: