Improved bounds on the multicolor Ramsey numbers of paths and even cycles
Charlotte Knierim, Pascal Su

TL;DR
This paper improves the upper bounds on multicolor Ramsey numbers for paths and even cycles, providing tighter estimates and new structural insights into connected graphs without large matchings.
Contribution
The authors establish a sharper upper bound of rac{1}{2} + o(1) for the multicolor Ramsey numbers, advancing previous bounds and introducing structural analysis techniques.
Findings
Improved upper bound of (k - 1/2 + o(1))n for R_k(P_n) and R_k(C_n)
Structural insights into connected graphs without large matchings
Potential applicability of methods to related combinatorial problems
Abstract
We study the multicolor Ramsey numbers for paths and even cycles, and , which are the smallest integers such that every coloring of the complete graph has a monochromatic copy of or respectively. For a long time, has only been known to lie between and . A recent breakthrough by S\'ark\"ozy and later improvement by Davies, Jenssen and Roberts give an upper bound of . We improve the upper bound to . Our approach uses structural insights in connected graphs without a large matching. These insights may be of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
