A note on the size Ramsey numbers for matchings versus cycles
For graphs $G$, $F_1$, $F_2$, we write $G \rightarrow(F_1, F_2)$ if for every red-blue colouring of the edge set of $G$ we have a red copy of $F_1$ or a blue copy of $F_2$ in $G$. The size Ramsey number $\hat{r}(F_1, F_2)$ is the minimum number of edges of a graph $G$ such that $G \rightarrow(F_1, F...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2021-07-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/146/2/mb146_2_9.pdf |