Ping Li

collaborators

2 papers

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…

math.CO2023

Constructing disjoint Steiner trees in Sierpiński graphs

Chenxu Yang, Ping Li, Yaping Mao +2

Let $G$ be a graph and $S \subseteq V (G)$ with $∣ S ∣ \geq 2$ . Then the trees $T_{1}, T_{2}, \dots, T_{ℓ}$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$ -Stei…