Fetching the paper…
Reading the bibliography…
A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring.
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.
S-functions for graphs
R. Halin · 1976
Earlier work this paper cites.
Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
G. Giraud · 1979
Earlier work this paper cites.
On the Ramsey multiplicities of graphs—problems and recent results
S. A. Burr and V. Rosta · 1980
Earlier work this paper cites.
On the number of complete subgraphs contained in certain graphs
R. J. Evans, J. R. Pulham, and J. Sheehan · 1981
Earlier work this paper cites.
Graph minors III: Planar tree-width
N. Robertson and P. D. Seymour · 1984
Earlier work this paper cites.
Cycles in graphs and functional inequalities
A. Sidorenko · 1989
Earlier work this paper cites.
A disproof of a conjecture of Erdős in Ramsey theory
A. Thomason · 1989
Earlier work this paper cites.
Inequalities for functionals generated by bipartite graphs
A. Sidorenko · 1992
Earlier work this paper cites.
Multiplicities of subgraphs
C. Jagger, P. Šťovíček, and A. Thomason · 1996
Earlier work this paper cites.
Randomness friendly graphs
A. Sidorenko · 1996
Cited alongside, same era.
Graph products and monochromatic multiplicities
A. Thomason · 1997
Cited alongside, same era.
CSDP, A C library for semidefinite programming
B. Borchers · 1999
Cited alongside, same era.
Bipartite subgraphs and quasi-randomness
J. Skokan and L. Thoma · 2004
Cited alongside, same era.
Flag algebras
A. A. Razborov · 2007
Cited alongside, same era.
The probabilistic method
N. Alon and J. H. Spencer · 2008
Cited alongside, same era.
There exist graphs with super-exponential Ramsey multiplicity constant
J. Fox · 2008
Cited alongside, same era.
Large Networks and Graph Limits
L. Lovász · 2012
Later among the works it cites.
Counting monochromatic copies of K 4 K_{4} : a new lower bound for the Ramsey multiplicity problem
S. Nieß · 2012
Later among the works it cites.
Flagmatic: A tool for researchers in extremal graph theory, 2013
E. Vaughan · 2013
Later among the works it cites.
A note on the inducibility of 4-vertex graphs
C. Even-Zohar and N. Linial · 2015
Later among the works it cites.
New results on Ramsey multiplicity and graph commonality
S. Raghuvanshi · 2016
Later among the works it cites.
Finite reflection groups and graph norms
D. Conlon and J. Lee · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An approximate version of Sidorenko’s conjecture
D. Conlon, J. Fox, and B. Sudakov · 2010
Cited alongside, same era.
The minimum number of monochromatic 4-term progressions in ℤ p \mathbb{Z}_{p}
J. Wolf · 2010
Cited alongside, same era.
On the minimal monochromatic K 4 K_{4} -density, 2011
K. Sperfeld · 2011
Cited alongside, same era.
Non-three-colourable common graphs exist
H. Hatami, J. Hladký, S. Norine, A. Razborov, and D. Král’ · 2012
Cited alongside, same era.
QSopt Linear Programming Solver
D. Applegate, W. Cook, S. Dash, and M. Mevenkamp
Cited in the paper.
Ramsey multiplicity of linear patterns in certain finite abelian groups
A. Saad and J. Wolf · 2017
Later among the works it cites.
On some graph densities in locally dense graphs
J. Lee · 2020
Closest in time.
Sidorenko’s conjecture for blow-ups
D. Conlon and J. Lee · 2021
Closest in time.
Non-bipartite k k -common graphs
D. Kráľ, J. A. Noel, S. Norin, J. Volec, and F. Wei · 2022
Closest in time.