4 papers
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\…
Asymptotic Bounds for t(3,n) and an Application to t(4,n)
Meng Ji, Yaping Mao, Ingo Schiermeyer
A set of vertices in a simple graph is irredundant if each vertex is either isolated in the induced subgraph or else has a private neighbor…
On the two problems in Ramsey achievement games
Zhong Huang, Yusuke Kobayashi, Yaping Mao +2
Let be two integers with . Given a finite graph with no isolated vertices, the generalized Ramsey achievement game of on the complete graph , denoted by…
Gallai-Ramsey number for the union of stars
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of the complete graph…