Abstract: For a graph and integer , let and denote the -color Ramsey number and list Ramsey number of , 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 and are always equal, 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 ErdH{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 sufficiently large compared with and , then [ r(S(n,m);k)=kn+m+2.] This is a step in our effort to determine whether and are always equal, which remains wide open. We also prove that if is odd and is sufficiently large compared with and , where and is obtained from by subdividing edges each exactly once. We end the paper with some observations towards the list Ramsey number for and .
Recommendations
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)