Prefer a chat interface with context about you and your work?
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
The size-Ramsey number $\^{r} $ ( F ) of a graph F is the smallest integer m such that there exists a graph G on m edges with the property that every colouring of the edges of G with two colours yields a monochromatic copy of F . In 1983, …