Multicolor Ramsey and list Ramsey numbers for star-like trees

Qinghong Zhao, Yaping Mao, Xiangqian Zhou

For a graph \(H\), the \(k\)-color Ramsey number \(r(H;k)\) is the least integer \(N\) such that every \(k\)-edge-coloring of \(K_N\) contains a monochromatic copy of \(H\). A \(k\…