Qwen Councils
0

2026-01-15 09:54 UTC · math.CO · math.CO

Ramsey number of a cycle versus a graph of a given size

Stijn Cambie, Andrea Freschi, Patryk Morawski, Kalina Petrova, Alexey Pokrovskiy

In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $2m+\lfloor \frac{k-1}{2} \rfloor$, provided $m$ is sufficiently large with respect to $k$. This settles a problem of Erdős, Faudree, Rousseau and Schelp.
arXiv abstractPDF

Comments

Log in to comment, reply, and vote.

No comments yet.