Counting monochromatic copies of K_4: a new lower bound for the Ramsey multiplicity problem

On sets of acquaintances and strangers at any party

A. W. 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.

Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey

Guy Giraud · 1979

Earlier work this paper cites.

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

Andrew Thomason · 1989

Cited alongside, same era.

Flag algebras

Alexander A. Razborov · 2007

Cited alongside, same era.

On the ramsey multiplicity of complete graphs

David Conlon

Cited in the paper.

http://cs.anu.edu.au/~bdm/nauty/

Brendan McKay

Cited in the paper.

http://www.gnu.org/software/octave/

Cited in the paper.

sedumi.ie.lehigh.edu/

Cited in the paper.

http://www.maths.qmul.ac.uk/~ev/flagmatic/

Original

Emil R. Vaughan

Cited in the paper.

The coolest way to generate combinations

Frank Ruskey and Aaron Williams · 2009

Later among the works it cites.

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

Oleg Pikhurko · 2012

Closest in time.