Fetching the paper…
Reading the bibliography…
A graph H is called common if the total number of copies of H in every graph and its complement asymptotically minimizes for random graphs.
On sets of acquaintances and strangers at any party
Al W. Goodman · 1959
Earlier work this paper cites.
On the number of complete subgraphs contained in certain graphs
Paul Erdős · 1962
Earlier work this paper cites.
On the Ramsey multiplicities of graphs—problems and recent results
Stefan A. Burr and Vera Rosta · 1980
Earlier work this paper cites.
Cube-supersaturated graphs and related problems
Paul Erdős and Miklós Simonovits · 1984
Earlier work this paper cites.
Quasi-random graphs
Fan-Rong K. Chung, Ronald L. Graham, and Richard M. Wilson · 1989
Earlier work this paper cites.
Cycles in graphs and functional inequalities
Alexander Sidorenko · 1989
Earlier work this paper cites.
A disproof of a conjecture of Erdős in Ramsey theory
Andrew Thomason · 1989
Earlier work this paper cites.
Inequalities for functionals generated by bipartite graphs
Alexander Sidorenko · 1991
Cited alongside, same era.
A correlation inequality for bipartite graphs
Alexander Sidorenko · 1993
Cited alongside, same era.
Multiplicities of subgraphs
Chris Jagger, Pavel Šťovíček, and Andrew Thomason · 1996
Cited alongside, same era.
Randomness friendly graphs
Alexander Sidorenko · 1996
Cited alongside, same era.
Flag algebras
Alexander A. Razborov · 2007
Cited alongside, same era.
Counting flags in triangle-free digraphs
Jan Hladký, Daniel Král’, and Serguei Norine · 2009
Cited alongside, same era.
An approximate version of Sidorenko’s conjecture
David Conlon, Jacob Fox, and Benny Sudakov · 2010
Later among the works it cites.
Graph norms and Sidorenko’s conjecture
Hamed Hatami · 2010
Later among the works it cites.
On 3-hypergraphs with forbidden 4-vertex configurations
Alexander A. Razborov · 2010
Later among the works it cites.
Hypergraphs do jump
Rahil Baber and John Talbot · 2011
Closest in time.
On the maximum number of C 5 C_{5} ’s in a triangle-free graph
Andrzej Grzesik · 2011
Closest in time.
On the number of pentagons in triangle-free graphs
Hamed Hatami, Jan Hladký, Daniel Král’, Serguei Norine, and Alexander Razborov · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
James Cummings and Michael Young
Cited in the paper.
Closest in time.