On the densities of cliques and independent sets in graphs

On an extremal problem in graph theory,

P. Turán, · 1941

Earlier work this paper cites.

On the structure of linear graphs,

P. Erdős and A. Stone, · 1946

Earlier work this paper cites.

On some properties of linear complexes,

A. Zykov, · 1949

Earlier work this paper cites.

On sets of acquaintances and strangers at any party,

A. Goodman, · 1959

Earlier work this paper cites.

On the number of complete subgraphs contained in certain graphs,

P. Erdős, · 1962

Earlier work this paper cites.

The number of simplicies in a complex, Mathematical Optimization Techniques, Univ. of California Press (1963), 251–278

J. Kruskal, · 1963

Earlier work this paper cites.

A theorem of finite sets, in Theory of Graphs, Akadémia Kiadó, Budapest (1968), 187–207

G. Katona, · 1968

Cited alongside, same era.

Aggregation of inequalities in integer programming,

V. Chvátal and P. Hammer, · 1977

Cited alongside, same era.

The shifting techniques in extremal set theory, in: Surveys in Combinatorics,

P. Frankl, · 1987

Cited alongside, same era.

A disproof of a conjecture of Erdős in Ramsey theory,

A. Thomason, · 1989

Cited alongside, same era.

2-colorings of complete graphs with small number of monochromatic K 4 K_{4} subgraphs,

F. Franek and V. Rödl, · 1993

Cited alongside, same era.

On packing densities of permutations,

M. H. Albert, M. D. Atkinson, C. C. Handley, D. A. Holton and W. Stromquist, · 2002

Cited alongside, same era.

Shadows and intersections: stability and new proofs,

P. Keevash, · 2008

Later among the works it cites.

On the minimal density of triangles in graphs,

A. Razborov, · 2008

Later among the works it cites.

The number of cliques in graphs of given order and size,

V. Nikiforov, · 2011

Later among the works it cites.

A problem of Erdős on the minimum of k k -cliques,

S. Das, H. Huang, J. Ma, H. Naves, and B. Sudakov, · 2013

Closest in time.

Two-colorings with many monochromatic cliques in both colors,

P. Frankl, M. Kato, G. Katona, and N. Tokushige, · 2013

Closest in time.

Minimum number of k k -cliques in graphs with bounded independence number,

O. Pikhurko and E. R. Vaughan, · 2013

Closest in time.