Fetching the paper…
Reading the bibliography…
Extending an earlier conjecture of Erd\H{o}s, Burr and Rosta conjectured that among all two-colorings of the edges of a complete graph, the uniformly random coloring asymptotically minimizes the number of monochromatic copies of any fixed graph $H$.
P. Erdös and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2
1935
Earlier work this paper cites.
P. Erdös, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53
1947
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.
P. Erdős, On extremal problems of graphs and generalized graphs, Israel J. Math. 2
1964
Earlier work this paper cites.
M. Simonovits, Extermal graph problems with symmetrical extremal graphs. Additional chromatic conditions, Discrete Math. 7
1974
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.
V. Chvátal and E. Szemerédi, On the Erdős-Stone theorem, J. London Math. Soc. (2) 23
1981
Earlier work this paper cites.
P. Erdős, Some new problems and results in graph theory and other branches of combinatorial mathematics, in Combinatorics and graph theory (Calcutta, 1980) , Lecture Notes in Math. , vol. 885, Springer, Berlin-New York, 1981, 9–17
1981
Earlier work this paper cites.
P. Erdős and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3
1983
Earlier work this paper cites.
H. Lefmann, A note on Ramsey numbers, Studia Sci. Math. Hungar. 22
1987
Earlier work this paper cites.
S. A. Burr, P. Erdős, R. J. Faudree, and R. H. Schelp, On the difference between consecutive Ramsey numbers, Utilitas Math. 35
1989
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. Sidorenko, A correlation inequality for bipartite graphs, Graphs Combin. 9
1993
Earlier work this paper cites.
C. Jagger, P. Šťovíček, and A. Thomason, Multiplicities of subgraphs, Combinatorica 16
1996
Earlier work this paper cites.
B. D. McKay and S. P. Radziszowski, Subgraph counting identities and Ramsey numbers, J. Combin. Theory Ser. B 69
1997
Earlier work this paper cites.
J. Nešetřil and M. Rosenfeld, I. Schur, C. E. Shannon and Ramsey numbers, a short story, Discrete Math. 229
2001
Earlier work this paper cites.
B. Bollobás and V. Nikiforov, Joints in graphs, Discrete Math. 308
2008
Cited alongside, same era.
J. Fox, There exist graphs with super-exponential Ramsey multiplicity constant, J. Graph Theory 57
2008
Cited alongside, same era.
V. Nikiforov and C. C. Rousseau, Ramsey goodness and beyond, Combinatorica 29
2009
Cited alongside, same era.
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.
P. Keevash, Hypergraph Turán problems, in Surveys in combinatorics 2011 , London Math. Soc. Lecture Note Ser. , vol. 392, Cambridge Univ. Press, Cambridge, 2011, 83–139
D. Conlon, The Ramsey number of books, Adv. Comb. (2019), Paper No. 3, 12
2019
Later among the works it cites.
H. Topcu, S. Sorgun, and W. H. Haemers, The graphs cospectral with the pineapple graph, Discrete Appl. Math. 269
2019
Later among the works it cites.
D. Conlon and J. Lee, Sidorenko’s conjecture for blow-ups, Discrete Anal. (2021), Paper No. 2, 13
2021
Later among the works it cites.
D. Gerbner, On Turán-good graphs, Discrete Math. 344
2021
Later among the works it cites.
S. P. Radziszowski, Small Ramsey numbers, Electron. J. Combin. 1
2021
Later among the works it cites.
Y. Wigderson, Complete r r -partite r r -graphs are Sidorenko: a brief exposition, 2021. Not intended for publication. Available at http://www.math.tau.ac.il/ yuvalwig/math/expository/HypergraphSidorenko.pdf
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
2011
Cited alongside, same era.
2011
Cited alongside, same era.
2011
Cited alongside, same era.
D. Conlon, On the Ramsey multiplicity of complete graphs, Combinatorica 32
2012
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.
2012
Cited alongside, same era.
2021
Later among the works it cites.
Y. Wigderson, An improved lower bound on multicolor Ramsey numbers, Proc. Amer. Math. Soc. 149
2021
Later among the works it cites.
D. Conlon, J. Fox, and Y. Wigderson, Ramsey numbers of books and quasirandomness, Combinatorica 42
2022
Closest in time.
D. Gerbner and C. Palmer, Some exact results for generalized Turán problems, European J. Combin. 103
2022
Closest in time.
A. Grzesik, J. Lee, B. Lidický, and J. Volec, On tripartite common graphs, Combin. Probab. Comput. (2022), 1–17
2022
Closest in time.
D. Král’, J. A. Noel, S. Norin, J. Volec, and F. Wei, Non-bipartite k k -common graphs, Combinatorica 42
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
W. Sawin, An improved lower bound for multicolor Ramsey numbers and a problem of Erdős, J. Combin. Theory Ser. A 188
2022
Closest in time.
Y. Wigderson, Ramsey numbers upon vertex deletion, 2022. Preprint available at arXiv:2208.11181
2022
Closest in time.
2023
Closest in time.