Paper Info
Title
Minimum Number of k-Cliques in Graphs with Bounded Independence Number.
Abstract
Erdos asked in 1962 about the value of f(n, k, l), the minimum number of k-cliques in a graph with order n and independence number less than l. The case (k, l) = (3, 3) was solved by Lorden. Here we solve the problem (for all large n) 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).
Year
DOI
Venue
2013
10.1017/S0963548313000357
COMBINATORICS PROBABILITY & COMPUTING
Field
DocType
Volume
Graph,Discrete mathematics,Combinatorics,Independence number,Mathematics,Bounded function
Journal
22
Issue
ISSN
Citations 
6
0963-5483
7
PageRank 
References 
Authors
0.60
7
2
Name
Order
Citations
PageRank
Oleg Pikhurko131847.03
Emil R. Vaughan2403.49