Yaping Mao

activity

20202026

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

On the two problems in Ramsey achievement games

Zhong Huang, Yusuke Kobayashi, Yaping Mao +2

Let $p, q$ be two integers with $p \geq q$ . Given a finite graph $F$ with no isolated vertices, the generalized Ramsey achievement game of $F$ on the complete graph $K_{n}$ , denoted by…

math.CO2024

Ramsey and Gallai-Ramsey numbers for linear forests and kipas

Ping Li, Yaping Mao, Ingo Schiermeyer +1

For two graphs $G, H$ , the \emph{Ramsey number} $r (G, H)$ is the minimum integer $n$ such that any red/blue edge-coloring of $K_{n}$ contains either a red copy of $G$ or a blue copy of…