Fetching the paper…
Reading the bibliography…
A system of linear equations $L$ over $\mathbb{F}_q$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $\mathbb{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random two-colouring of $\mathbb{F}_q^n$.
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 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.
On Schur properties of random subsets of integers
R. Graham, V. Rödl, and A. Ruciński · 1996
Earlier work this paper cites.
Multiplicities of subgraphs
C. Jagger, P. Šťovíček, and A. Thomason · 1996
Earlier work this paper cites.
Finite fields
R. Lidl and H. Niederreiter · 1997
Earlier work this paper cites.
Rado partition theorem for random subsets of integers
V. Rödl and A. Ruciński · 1997
Earlier work this paper cites.
Graph products and monochromatic multiplicities
A. Thomason · 1997
Earlier work this paper cites.
The number of monochromatic Schur triples
T. Schoen · 1999
Cited alongside, same era.
On the number of monochromatic Schur triples
B. A. Datskovsky · 2003
Cited alongside, same era.
Additive Combinatorics
T. Tao and V. H. Vu · 2006
Cited alongside, same era.
On monochromatic solutions of equations in groups
P. Cameron, J. Cilleruelo, and O. Serra · 2007
Cited alongside, same era.
There exist graphs with super-exponential Ramsey multiplicity constant
J. Fox · 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
An information theoretic approach to Sidorenko’s conjecture
B. Szegedy · 2014
Later among the works it cites.
Two approaches to Sidorenko’s conjecture
J. H. Kim, C. Lee, and J. Lee · 2016
Later among the works it cites.
Generalizations of Fourier analysis, and how to apply them
W. T. Gowers · 2017
Later among the works it cites.
Ramsey multiplicity of linear patterns in certain finite abelian groups
A. Saad and J. Wolf · 2017
Later among the works it cites.
Some advances on Sidorenko’s conjecture
D. Conlon, J. H. Kim, C. Lee, and J. Lee · 2018
Later among the works it cites.
A uniform set with fewer than expected arithmetic progressions of length 4
W. T. Gowers · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Hatami · 2010
Cited alongside, same era.
The minimum number of monochromatic 4-term progressions in ℤ p \mathbb{Z}_{p}
J. Wolf · 2010
Cited alongside, same era.
On the logarithmic calculus and Sidorenko’s conjecture
J. X. Li and B. Szegedy · 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ỳ, S. Norine, and A. Razborov · 2012
Cited alongside, same era.
Towards characterizing locally common graphs
R. Hancock, D. Král’, M. Krnc, and J. Volec
Cited in the paper.
Sidorenko’s conjecture for blow-ups
D. Conlon and J. Lee · 2021
Closest in time.
Common and Sidorenko Linear Equations
J. Fox, H. T. Pham, and Y. Zhao · 2021
Closest in time.
Towards a characterisation of Sidorenko systems
N. Kamčev, A. Liebenau, and N. Morrison · 2021
Closest in time.
Linear configurations containing 4-term arithmetic progressions are uncommon
L. Versteegen · 2021
Closest in time.