A note on the size Ramsey numbers for matchings versus cycles
Edy Tri Baskoro, Tomáš Vetrík (2021)
Mathematica Bohemica
Similarity:
For graphs , , , we write if for every red-blue colouring of the edge set of we have a red copy of or a blue copy of in . The size Ramsey number is the minimum number of edges of a graph such that . Erdős and Faudree proved that for the cycle of length and for matchings , the size Ramsey number . We improve their upper bound for and by showing that for and for .