Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. Beck, J.: On Size Ramsey Number of Paths, Trees and Circuits II. In: Nesetril, J., Rodl, V. (eds.) Mathematics of Ramsey Theory, vol. 5, pp. 34–45. Springer, Berlin (1990)
2. Conlon, D., Nenadov, R., Trujić, M.: The size-Ramsey number of cubic graphs. Bull. Lond. Math. Soc. 54(6), 2135–2150 (2022)
3. Draganić, N., Petrova, K.: Size-Ramsey numbers of graphs with maximum degree three, preprint, arXiv:2207.05048
4. Erdős, P., Faudree, R.J., Rousseau, C.C., Schelp, R.H.: The size Ramsey number. Period. Math. Hungar. 9(1–2), 145–161 (1978)
5. Kohayakawa, Y., Rödl, V., Schacht, M., Szemerédi, E.: Sparse partition universal graphs for graphs of bounded degree. Adv. Math. 226(6), 5041–5065 (2011)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献