Fetching the paper…
Reading the bibliography…
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H.
F. P. Ramsey: On a problem of formal logic , Proceedings of the London Mathematical Society 2
1930
Earlier work this paper cites.
P. Erdős: Graph theory and probability , Canadian J. Math. 11
1959
Earlier work this paper cites.
A. W. Goodman: On sets of acquaintances and strangers at any party , Amer. Math. Monthly 66
1959
Earlier work this paper cites.
P. Erdős: On the number of complete subgraphs contained in certain graphs , Magyar Tud. Akad. Mat. Kutató Int. Közl. 7
1962
Earlier work this paper cites.
G. R. Blakley and P. Roy: A Hölder type inequality for symmetric matrices with nonnegative entries , Proc. Amer. Math. Soc. 16
1965
Earlier work this paper cites.
N. Hindman: Finite sums from sequences within cells of a partition of N N , J. Combinatorial Theory Ser. A 17
1974
Earlier work this paper cites.
Collection of articles in memory of Juriĭ Vladimirovič Linnik
E. Szemerédi: On sets of integers containing no k k elements in arithmetic progression , Acta Arith. 27 · 1975
Earlier work this paper cites.
S. A. Burr and V. Rosta: On the Ramsey multiplicities of graphs—problems and recent results , J. Graph Theory 4
1980
Earlier work this paper cites.
P. Erdős and M. Simonovits: Supersaturated graphs and hypergraphs , Combinatorica 3
1983
Earlier work this paper cites.
A. F. Sidorenko: Extremal problems in graph theory and functional-analytic inequalities , Proceedings of the All-Union seminar on discrete mathematics and its applications (Russian) (1986), 99–105
1986
Earlier work this paper cites.
A. F. Sidorenko: Cycles in graphs and functional inequalities , Mat. Zametki 46
1989
Earlier work this paper cites.
A. Thomason: A disproof of a conjecture of Erdős in Ramsey theory , J. London Math. Soc. (2) 39
1989
Earlier work this paper cites.
A. F. Sidorenko: Inequalities for functionals generated by bipartite graphs , Diskret. Mat. 3
1991
Earlier work this paper cites.
L. Clark: The minimum number of subgraphs in a graph and its complement , J. Graph Theory 16
1992
Earlier work this paper cites.
A. Sidorenko: A correlation inequality for bipartite graphs , Graphs Combin. 9
1993
Cited alongside, same era.
C. Jagger, P. Šťovíček and A. Thomason: Multiplicities of subgraphs , Combinatorica 16
1996
Cited alongside, same era.
A. Sidorenko: Randomness friendly graphs , Random Structures Algorithms 8
1996
Cited alongside, same era.
A. A. Razborov: Flag algebras , J. Symbolic Logic 72
2007
Cited alongside, same era.
J. Fox: There exist graphs with super-exponential Ramsey multiplicity constant , J. Graph Theory 57
2008
Cited alongside, same era.
D. Conlon: A new upper bound for diagonal ramsey numbers , Ann. of Math. (2) 170
2009
Cited alongside, same era.
D. Conlon, J. Fox and B. Sudakov: Recent developments in graph Ramsey theory , in: Surveys in combinatorics 2015, London Math. Soc. Lecture Note Ser. , volume 424 (2015), 49–118
2015
Later among the works it cites.
N. Alon and J. H. Spencer: The probabilistic method, Wiley Series in Discrete Mathematics and Optimization, 2016, fourth edition
2016
Later among the works it cites.
D. Conlon and J. Lee: Finite reflection groups and graph norms , Adv. Math. 315
2017
Later among the works it cites.
The European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB’17)
J. Fox and F. Wei: On the local approach to Sidorenko’s conjecture , Electron. Notes Discrete Math. 61 · 2017
Later among the works it cites.
D. Conlon, J. H. Kim, C. Lee and J. Lee: Some advances on Sidorenko’s conjecture , J. Lond. Math. Soc. 98
2018
Later among the works it cites.
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: An approximate version of Sidorenko’s conjecture , Geom. Funct. Anal. 20
2010
Cited alongside, same era.
H. Hatami: Graph norms and Sidorenko’s conjecture , Israel J. Math. 175
2010
Cited alongside, same era.
Y. Kohayakawa, B. Nagle, V. Rödl and M. Schacht: Weak hypergraph regularity and linear hypergraphs , J. Combin. Theory Ser. B 100
2010
Cited alongside, same era.
L. Lovász: Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture , Electron. J. Combin. 18
2011
Cited alongside, same era.
H. Hatami, J. Hladký, D. Kráľ, S. Norine and A. Razborov: Non-three-colourable common graphs exist , Combin. Probab. Comput. 21
2012
Cited alongside, same era.
L. Lovász: Large networks and graph limits, AMS Colloquium Publications , volume 60, 2012
2012
Cited alongside, same era.
J. W. Cooper, D. Kráľ and T. L. Martins: Finitely forcible graph limits are universal , Adv. Math. 340
2018
Later among the works it cites.
D. Conlon and J. Lee: Sidorenko’s conjecture for blow-ups , Discrete Anal. (2021), paper no. 2, 13pp
2021
Later among the works it cites.
J. Lee: On some graph densities in locally dense graphs , Random Structures Algorithms 58
2021
Later among the works it cites.
A. Grzesik, J. Lee, B. Lidický and J. Volec: On tripartite common graphs , Combin. Probab. Comput. (2022), 907–923
2022
Closest in time.
D. Král’, J. A. Noel, S. Norin, J. Volec and F. Wei: Non-bipartite k-common graphs , Combinatorica 42
2022
Closest in time.
E. Csóka, T. Hubai and L. Lovász: Locally common graphs , J. Graph Theory 102
2023
Closest in time.
R. Hancock, D. Král’, M. Krnc and J. Volec: Towards characterizing locally common graphs , Random Structures Algorithms 62
2023
Closest in time.
S. Ko and J. Lee: Common graphs with arbitrary connectivity and chromatic number , J. Combin. Theory Ser. B 162
2023
Closest in time.
A. Sah: Diagonal ramsey via effective quasirandomness , Duke Math. J. 172
2023
Closest in time.