Multicolor Ramsey Number for Double Stars

From MaRDI portal
(Redirected from Publication:6416401)



Abstract: For a graph H and integer kge1, let r(H;k) and rell(H;k) denote the k-color Ramsey number and list Ramsey number of H, respectively. Motivated by the work of Alon, Buci'c, Kalvari, Kuperwasser and Szab'o, who initiated the systematic study of list Ramsey numbers of graphs and hypergraphs, and conjectured that r(K1,n;k) and rell(K1,n;k) are always equal, we study the k-color Ramsey number for double stars S(n,m), where ngemge1. To the best of our knowledge, little is known on the exact value of r(S(n,m);k) when kge3. A classic result of ErdH{o}s and Graham from 1975 asserts that r(T;k)>k(n−1)+1 for every tree T with nge1 edges and k sufficiently large such that n divides k−1. Using a folklore double counting argument in set system and the edge chromatic number of complete graphs, we prove that if k is odd and n is sufficiently large compared with m and k, then [ r(S(n,m);k)=kn+m+2.] This is a step in our effort to determine whether r(S(n,m);k) and rell(S(n,m);k) are always equal, which remains wide open. We also prove that r(Snm;k)=k(n−1)+m+2 if k is odd and n is sufficiently large compared with m and k, where 1lemlen and Snm is obtained from K1,n by subdividing m edges each exactly once. We end the paper with some observations towards the list Ramsey number for S(n,m) and Snm.












This page was built for publication: Multicolor Ramsey Number for Double Stars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6416401)