Size-Ramsey numbers of cycles versus a path

Andrzej Dudek, Farideh Khoeini, Paweł Prałat

The size-Ramsey number $\hat{R}(\mathcal{F},H)$ of a family of graphs $\mathcal{F}$ and a graph $H$ is the smallest integer $m$ such that there exists a graph $G$ on $m$ edges with…