Multicolor Ramsey Number for Double Stars
Jake Ruotolo, Zi-Xia Song

TL;DR
This paper determines the exact multicolor Ramsey number for double stars when the number of colors is odd and large enough, advancing understanding of these numbers and their relation to list Ramsey numbers.
Contribution
It provides new exact formulas for the Ramsey numbers of double stars in certain cases, addressing a gap in the knowledge of these classical graph invariants.
Findings
r(S(n,m);k)=kn+m+2 for odd k and large n
r(S^m_n;k)=k(n-1)+m+2 under similar conditions
Initial insights into the relationship between Ramsey and list Ramsey numbers for double stars
Abstract
For a graph and an integer , let and denote the -color Ramsey number and list Ramsey number of , respectively. Alon, Buci\'c, Kalvari, Kuperwasser and Szab\'o in 2021 initiated the systematic study of list Ramsey numbers of graphs and hypergraphs, and conjectured that and are always equal. Motivated by their work, we study the -color Ramsey number for double stars , where . To the best of our knowledge, little is known on the exact value of when . A classic result of Erd\H{o}s and Graham from 1975 asserts that for every tree with edges and sufficiently large such that divides . Using a folklore double counting argument in set system and the edge chromatic number of complete graphs, we prove that if is odd and is…
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
