Fetching the paper…
Reading the bibliography…
The size Ramsey number of a graph $H$ is defined as the minimum number of edges in a graph $G$ such that there is a monochromatic copy of $H$ in every two-coloring of $E(G)$.
P. Erdős, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, The size Ramsey number, Period. Math. Hungar. 9
1978
Earlier work this paper cites.
J. Beck, On size Ramsey number of paths, trees, and circuits. I, J. Graph Theory 7
1983
Earlier work this paper cites.
J. Friedman and N. Pippenger, Expanding graphs contain all small trees, Combinatorica 7
1987
Earlier work this paper cites.
J. Beck, On size Ramsey number of paths, trees and circuits. II, in Mathematics of Ramsey theory, Algorithms Combin., vol. 5, Springer, Berlin, 1990, 34–45
1990
Earlier work this paper cites.
P. Erdős and C. C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Math. 113
1993
Earlier work this paper cites.
P. E. Haxell, Y. Kohayakawa, and T. Łuczak, The induced size-Ramsey number of cycles, Combin. Probab. Comput. 4
1995
Earlier work this paper cites.
S. Janson, T. Łuczak, and A. Rucinski, Random graphs , Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000
2000
Earlier work this paper cites.
V. Rödl and E. Szemerédi, On size Ramsey numbers of graphs with bounded degree, Combinatorica 20
2000
Earlier work this paper cites.
O. Pikhurko, Asymptotic size Ramsey results for bipartite graphs, SIAM J. Discrete Math. 16
2002
Earlier work this paper cites.
T. Szabó and V. H. Vu, Turán’s theorem in sparse random graphs, Random Structures Algorithms 23
2003
Earlier work this paper cites.
M. Krivelevich and B. Sudakov, Pseudo-random graphs, in More sets, graphs and numbers, Bolyai Soc. Math. Stud., vol. 15, Springer, Berlin, 2006, 199–262
2006
Cited alongside, same era.
L. Lovász, Combinatorial problems and exercises , second edition, AMS Chelsea Publishing, Providence, RI, 2007
2007
Cited alongside, same era.
Y. Kohayakawa, V. Rödl, M. Schacht, and E. Szemerédi, Sparse partition universal graphs for graphs of bounded degree, Adv. Math. 226
2011
Cited alongside, same era.
J. Balogh, R. Morris, and W. Samotij, Independent sets in hypergraphs, J. Amer. Math. Soc. 28
2015
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. , vol. 424, Cambridge Univ. Press, Cambridge, 2015, 49–118
2015
J. Han, M. Jenssen, Y. Kohayakawa, G. O. Mota, and B. Roberts, The multicolour size-Ramsey number of powers of paths, J. Combin. Theory Ser. B 145
2020
Later among the works it cites.
S. Berger, Y. Kohayakawa, G. S. Maesaka, T. Martins, W. Mendonça, G. O. Mota, and O. Parczyk, The size-Ramsey number of powers of bounded degree trees, J. London Math. Soc. 103
2021
Closest in time.
D. Clemens, M. Miralaei, D. Reding, M. Schacht, and A. Taraz, On the size-Ramsey number of grid graphs, Combin. Probab. Comput. 30
2021
Closest in time.
N. Draganić, M. Krivelevich, and R. Nenadov, Rolling backwards can move you forward: on embedding problems in sparse expanders, in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2021, 123–134
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
D. Saxton and A. Thomason, Hypergraph containers, Invent. Math. 201
2015
Cited alongside, same era.
D. Conlon and W. T. Gowers, Combinatorial theorems in sparse random sets, Ann. of Math. 184
2016
Cited alongside, same era.
M. Schacht, Extremal results for random discrete structures, Ann. of Math. 184
2016
Cited alongside, same era.
D. Clemens, M. Jenssen, Y. Kohayakawa, N. Morrison, G. O. Mota, D. Reding, and B. Roberts, The size-Ramsey number of powers of paths, J. Graph Theory 91
2019
Cited alongside, same era.
D. Conlon, The Ramsey number of books, Adv. Comb. (2019), Paper No. 3, 12pp
2019
Cited alongside, same era.
Cited in the paper.
Cited in the paper.
N. Draganić, M. Krivelevich, and R. Nenadov, The size-Ramsey number of short subdivisions, Random Structures Algorithms 59
2021
Closest in time.
J. Han, Y. Kohayakawa, S. Letzter, G. O. Mota, and O. Parczyk, The size-Ramsey number of 3-uniform tight paths, Adv. Combin. (2021), 1–12
2021
Closest in time.
N. Kamčev, A. Liebenau, D. R. Wood, and L. Yepremyan, The size Ramsey number of graphs with bounded treewidth, SIAM J. Discrete Math. 35
2021
Closest in time.
D. Conlon, J. Fox, and Y. Wigderson, Ramsey numbers of books and quasirandomness, Combinatorica 42
2022
Closest in time.
D. Conlon, R. Nenadov, and M. Trujić, The size-Ramsey number of cubic graphs, Bull. London Math. Soc. 54
2022
Closest in time.