Fetching the paper…
Reading the bibliography…
A graph $H$ is common if the limit as $n\to\infty$ of the minimum density of monochromatic labelled copies of $H$ in an edge colouring of $K_n$ with red and blue is attained by a sequence of quasirandom colourings.
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.
On the Ramsey multiplicities of graphs—problems and recent results
S. A. Burr and V. Rosta · 1980
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. Sidorenko · 1993
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
Earlier work this paper cites.
Limits of dense graph sequences
L. Lovász and B. Szegedy · 2006
Earlier work this paper cites.
The homomorphism domination exponent
S. Kopparty and B. Rossman · 2011
Earlier work this paper cites.
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.
Monochromatic triangles in three-coloured graphs
J. Cummings, D. Kráľ, F. Pfender, K. Sperfeld, A. Treglown, and M. Young · 2013
Cited alongside, same era.
Recent developments in graph Ramsey theory
D. Conlon, J. Fox, and B. Sudakov · 2015
Cited alongside, same era.
An information theoretic approach to Sidorenko’s conjecture
B. Szegedy · 2015
Cited alongside, same era.
Finite reflection groups and graph norms
D. Conlon and J. Lee · 2017
Cited alongside, same era.
Extended commonality of paths and cycles via Schur convexity
J. S. Kim and J. Lee · 2022
Later among the works it cites.
Common graphs with arbitrary connectivity and chromatic number
S. Ko and J. Lee · 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.
Common graphs with arbitrary chromatic number
D. Kráľ, J. Volec, and F. Wei · 2022
Later among the works it cites.
Sidorenko-type inequalities for pairs of trees
N. Behague, G. Crudele, J. A. Noel, and L. M. Simbaqueba · 2023
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Some advances on Sidorenko’s conjecture
D. Conlon, J. H. Kim, C. Lee, and J. Lee · 2018
Cited alongside, same era.
On some graph densities in locally dense graphs
J. Lee · 2021
Cited alongside, same era.
A path forward: tropicalization in extremal combinatorics
G. Blekherman and A. Raymond · 2022
Cited alongside, same era.
On tripartite common graphs
A. Grzesik, J. Lee, B. Lidický, and J. Volec · 2022
Cited alongside, same era.
N. Behague, N. Morrison, and J. A. Noel · 2023
Closest in time.
A property on monochromatic copies of graphs containing a triangle
H. Chen and J. Ma · 2023
Closest in time.
Disconnected common graphs via supersaturation
J.-B. Lee and J. A. Noel · 2023
Closest in time.
Strongly common graphs with odd girth are cycles
L. Versteegen · 2023
Closest in time.