2000 character limit reached
The multicolour size Ramsey number of a path (2511.16656v1)
Published 20 Nov 2025 in math.CO
Abstract: In this paper, we determine the $r$-colour size Ramsey number of the path $P_k$, up to constants. In particular, for every fixed $r \geq 2$ and $k \geq 100\log r$, we have [ \widehat{R}_r(P_k)=Θ((r2 \log r) \, k).] Perhaps surprisingly, we do this by improving the lower bound on $\widehat{R}_r(P_k)$.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.