Fetching the paper…
Reading the bibliography…
For a graph G, let p_i(G), i=0,...,3 be the probability that three distinct random vertices span exactly i edges.
On the structure of linear graphs
P. Erdös and A.H. Stone · 1946
Earlier work this paper cites.
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.
The number of simplices in a complex
J. Kruskal · 1963
Earlier work this paper cites.
A theorem of finite sets
G. Katona · 1968
Earlier work this paper cites.
The inducibility of graphs
N. Pippenger and M.C. Golumbic · 1975
Earlier work this paper cites.
Asymptotic enumeration of K n K_{n} -free graphs
P. Erdős, D.J. Kleitman, and B.L. Rothschild · 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.
The maximal number of induced complete bipartite graphs
B. Bollobás, C. Nara, and S. Tachibana · 1986
Cited alongside, same era.
Dense packings of induced subgraphs
G. Exoo · 1986
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.
The inducibility of complete bipartite graphs
J. I. Brown and A. Sidorenko · 1994
Cited alongside, same era.
Flag algebras
A.A. Razborov · 2007
Cited alongside, same era.
On the minimal density of triangles in graphs
On 3-hypergraphs with forbidden 4-vertex configurations
A.A. Razborov · 2010
Later among the works it cites.
The inducibility of blow-up graphs
H. Hatami, J. Hirst, and S. Norine · 2011
Later among the works it cites.
Undecidability of linear inequalities in graph homomorphism densities
H. Hatami and S. Norine · 2011
Later among the works it cites.
The inducibility of graphs on four vertices
J. Hirst · 2011
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A.A. Razborov · 2008
Cited alongside, same era.
On the densities of cliques and independent sets in graphs, submitted
H. Huang, N. Linial, H. Naves, Y. Peled, and B. Sudakov
Cited in the paper.
Minimum number of k k -cliques in graphs with bounded independence number, submitted
O. Pikhurko,
Cited in the paper.
Minimizing the number of cliques in graphs of given order and edge density, manuscript
C. Reiher
Cited in the paper.
K. Sperfeld · 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.