On the minimum number of k-cliques in graphs with restricted independence number
V Nikiforov - Combinatorics, Probability and Computing, 2001 - cambridge.org
Combinatorics, Probability and Computing, 2001•cambridge.org
We investigate the following problem of Erdős: Determine the minimum number of k-cliques
in a graph of order n with independence number [ges] l. We disprove the original conjecture
of Erdős which was stated in 1962 for all but a finite number of pairs k, l, and give asymptotic
estimates for l= 3, k [ges] 4, and l= 4, k [ges] 4.
in a graph of order n with independence number [ges] l. We disprove the original conjecture
of Erdős which was stated in 1962 for all but a finite number of pairs k, l, and give asymptotic
estimates for l= 3, k [ges] 4, and l= 4, k [ges] 4.
We investigate the following problem of Erdős:Determine the minimum number of k-cliques in a graph of order n with independence number [ges ] l.We disprove the original conjecture of Erdős which was stated in 1962 for all but a finite number of pairs k, l, and give asymptotic estimates for l = 3, k [ges ] 4, and l = 4, k [ges ] 4.
Cambridge University PressShowing the best result for this search. See all results