On the Size-Ramsey Number of Cycles
On the Size-Ramsey Number of Cycles
Abstract For given graphs G 1 ,…, G k , the size-Ramsey number $\hat R({G_1}, \ldots ,{G_k})$ is the smallest integer m for which there exists a graph H on m edges such that in every k -edge colouring of H with colours 1,…, k , H contains a monochromatic …