Indexed metadata

Multicolor Ramsey numbers of unbalanced double stars

Lin Niu

Source record

Source: arXiv

Published: Oct 17, 2026

arXiv: 2610.24523

Open original source ↗

Source abstract

For integers n≥m≥1n\ge m\ge1, let S(n,m)S(n,m) be the double star obtained by joining the centers of K1,nK_{1,n} and K1,mK_{1,m}. Ruotolo and Song proved the upper bound r(S(n,m);k)≤kn+m+2r(S(n,m);k)\le kn+m+2 under the condition (n+1)⌈n+1k−1⌉>m((k−1)n+m)(n+1)\lceil\frac{n+1}{k-1}\rceil >m((k-1)n+m), as well as the matching lower bound for odd kk. Zhao, Mao and Zhou proved the matching lower bound for even kk and even nn. We establish the remaining lower bound for even k≥6k\ge6 and odd nn through a new edge-coloring construction. Combining these results, we obtain r(S(n,m);k)=kn+m+2r(S(n,m);k)=kn+m+2 for all integers k≥5k\ge5 and n≥m≥1n\ge m\ge1 satisfying (n+1)⌈n+1k−1⌉>m((k−1)n+m)(n+1)\lceil\frac{n+1}{k-1}\rceil >m((k-1)n+m). We also determine the four-color Ramsey number for m≥2m\ge2 and odd n≥15mn\ge15m, showing that r(S(n,m);4)=4n+m+1r(S(n,m);4)=4n+m+1.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Multicolor Ramsey numbers of unbalanced double stars — Mathematical Frontier Network