Fetching the paper…
Reading the bibliography…
A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a $2$-colouring of the edges of a large complete graph is asymptotically minimized by a random colouring.
Some remarks on the theory of graphs
P. Erdős · 1947
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.
Analytic inequalities
D. S. Mitrinović · 1970
Earlier work this paper cites.
Ramsey’s theorem—a new lower bound
J. Spencer · 1975
Earlier work this paper cites.
Relations between sets of complete subgraphs
B. Bollobás · 1976
Earlier work this paper cites.
Extremal graph theory
B. Bollobás · 1978
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.
Lower bounds on the number of triangles in a graph
D. C. Fisher · 1989
Earlier work this paper cites.
Cycles in graphs and functional inequalities
A. F. 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.
A correlation inequality for bipartite graphs
A. F. Sidorenko · 1993
Earlier work this paper cites.
Multiplicities of subgraphs
C. Jagger, P. Šťovíček, and A. Thomason · 1996
Earlier work this paper cites.
Clique polynomials have a unique root of smallest modulus
M. Goldwurm and M. Santini · 2000
Earlier work this paper cites.
Flag algebras
A. A. Razborov · 2007
Earlier work this paper cites.
On the minimal density of triangles in graphs
A. A. Razborov · 2008
Cited alongside, same era.
An approximate version of Sidorenko’s conjecture
D. Conlon, J. Fox, and B. Sudakov · 2010
Cited alongside, same era.
Graph norms and Sidorenko’s conjecture
H. Hatami · 2010
Cited alongside, same era.
Graphs containing triangles are not 3-common
J. Cummings and M. Young · 2011
Cited alongside, same era.
Non-three-colourable common graphs exist
H. Hatami, J. Hladký, D. Kráľ, S. Norine, and A. Razborov · 2012
Cited alongside, same era.
Large networks and graph limits
L. Lovász · 2012
Cited alongside, same era.
On some graph densities in locally dense graphs
J. Lee · 2021
Later among the works it cites.
A path forward: tropicalization in extremal combinatorics
G. Blekherman and A. Raymond · 2022
Later among the works it cites.
On tripartite common graphs
A. Grzesik, J. Lee, B. Lidický, and J. Volec · 2022
Later among the works it cites.
Non-bipartite k k -common graphs
D. Kráľ, J. A. Noel, S. Norin, J. Volec, and F. Wei · 2022
Later among the works it cites.
Locally common graphs
E. Csóka, T. Hubai, and L. Lovász · 2023
Closest in time.
Ramsey multiplicity and the Turán coloring
J. Fox and Y. Wigderson · 2023
Closest in time.
Toward characterizing locally common graphs
R. Hancock, D. Kráľ, M. Krnc, and J. Volec · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Szegedy · 2015
Cited alongside, same era.
Positive graphs
O. Antolín Camarena, E. Csóka, T. Hubai, G. Lippner, and L. Lovász · 2016
Cited alongside, same era.
Two approaches to Sidorenko’s conjecture
J. H. Kim, C. Lee, and J. Lee · 2016
Cited alongside, same era.
New results on Ramsey multiplicity and graph commonality
S. Raghuvanshi · 2016
Cited alongside, same era.
Finite reflection groups and graph norms
D. Conlon and J. Lee · 2017
Cited alongside, same era.
Some advances on Sidorenko’s conjecture
D. Conlon, J. H. Kim, C. Lee, and J. Lee · 2018
Cited alongside, same era.
Closest in time.
Common graphs with arbitrary connectivity and chromatic number
S. Ko and J. Lee · 2023
Closest in time.
Strongly common graphs with odd girth are cycles
L. Versteegen · 2023
Closest in time.
Off-diagonal commonality of graphs via entropy
N. Behague, N. Morrison, and J. A. Noel · 2024
Closest in time.
A property on monochromatic copies of graphs containing a triangle
H. Chen and J. Ma · 2024
Closest in time.
Extended commonality of paths and cycles via Schur convexity
J. S. Kim and J. Lee · 2024
Closest in time.
Common pairs of graphs
N. Behague, N. Morrison, and J. A. Noel · 2025
Closest in time.
Common graphs with arbitrary chromatic number
D. Kráľ, J. Volec, and F. Wei · 2025
Closest in time.