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 red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour.
On a Problem of Formal Logic
F. P. Ramsey · 1929
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.
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.
Graph products and monochromatic multiplicities
A. Thomason · 1997
Earlier work this paper cites.
Flag algebras
A. A. Razborov · 2007
Earlier work this paper cites.
There exist graphs with super-exponential Ramsey multiplicity constant
J. Fox · 2008
Earlier work this paper cites.
An approximate version of Sidorenko’s conjecture
D. Conlon, J. Fox, and B. Sudakov · 2010
Earlier work this paper cites.
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.
Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
L. Lovász · 2011
Cited alongside, same era.
On the Ramsey multiplicity of complete graphs
D. Conlon · 2012
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.
Recent developments in graph Ramsey theory
Sidorenko’s conjecture for blow-ups
D. Conlon and J. Lee · 2021
Later among the works it cites.
Common and Sidorenko linear equations
J. Fox, H. T. Pham, and Y. Zhao · 2021
Later among the works it cites.
On uncommon systems of equations
N. Kamčev, A. Liebenau, and N. Morrison · 2021
Later among the works it cites.
Linear configurations containing 4-term arithmetic progressions are uncommon
L. Versteegen · 2021
Later among the works it cites.
Ramsey multiplicity and the Turán coloring
J. Fox and Y. Widgerson · 2022
Closest in time.
On tripartite common graphs
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. Conlon, J. Fox, and B. Sudakov · 2015
Cited alongside, same era.
A note on the inducibility of 4-vertex graphs
C. Even-Zohar and N. Linial · 2015
Cited alongside, same era.
An information theoretic approach to Sidorenko’s conjecture
B. Szegedy · 2015
Cited alongside, same era.
Two approaches to Sidorenko’s conjecture
J. H. Kim, C. Lee, and J. Lee · 2016
Cited alongside, same era.
Finite reflection groups and graph norms
D. Conlon and J. Lee · 2017
Cited alongside, same era.
Ramsey multiplicity of linear patterns in certain finite abelian groups
A. Saad and J. Wolf · 2017
Cited alongside, same era.
A. Grzesik, J. Lee, B. Lidický, and J. Volec · 2022
Closest in time.
Common graphs with arbitrary connectivity and chromatic number
S. Ko and J. Lee · 2022
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.
Common graphs with arbitrary chromatic number
D. Kráľ, J. Volec, and F. Wei · 2022
Closest in time.
New Ramsey multiplicity bounds and search heuristics
O. Parczyk, S. Pokutta, C. Spiegel, and T. Szabó · 2022
Closest in time.
Off-diagonal commonality of graphs via entropy
N. Behague, N. Morrison, and J. A. Noel · 2023
Closest in time.
Locally common graphs
E. Csóka, T. Hubai, and L. Lovász · 2023
Closest in time.
Toward characterizing locally common graphs
R. Hancock, D. Kráľ, M. Krnc, and J. Volec · 2023
Closest in time.
Common and Sidorenko equations in Abelian groups
L. Versteegen · 2023
Closest in time.