Zhidan Luo

collaborators

4 papers

math.CO2026

Size Ramsey minimal graphs for uniform star forests

Pingting Fu, Zhidan Luo, Zhenyu Ni

For given graphs $G_{1}, G_{2}, \dots, G_{t}$ and $G$ , let $G \to (G_{1}, G_{2}, \dots, G_{t})$ denote that each $t$ -coloring of $E (G)$ yields a monochromatic copy of $G_{i}…

math.CO2026

The $s$ -chromatic Ramsey number for stars

Aijun Yi, Zhidan Luo

In 1977, Chung, Chung and Liu generalized the definition of the Ramsey number. They introduced the $s$ -chromatic Ramsey number as follows. Let $1 \leq s < t$ be integers and let $A_{…

math.CO2025

A note on degree conditions for Ramsey goodness of trees

Zhidan Luo, Yuejian Peng

For given graphs $G_{1}, G_{2}$ and $G$ , let $G \to (G_{1}, G_{2})$ denote that each red-blue-coloring of $E (G)$ yields a red copy of $G_{1}$ or a blue copy of $G_{2}$ . Arag…

math.CO2025

All Ramsey critical graphs for a large tree versus $t K_{m}$

Zhiyu Cheng, Zhidan Luo, Pingge Chen

Let $H, H_{1}$ and $H_{2}$ be graphs, and let $H \to (H_{1}, H_{2})$ denote that any red-blue coloring of $E (H)$ yields a red copy of $H_{1}$ or a blue copy of $H_{2}$ . The…

Size Ramsey minimal graphs for uniform star forests

The s-chromatic Ramsey number for stars

A note on degree conditions for Ramsey goodness of trees

All Ramsey critical graphs for a large tree versus tKm​

The $s$ -chromatic Ramsey number for stars

All Ramsey critical graphs for a large tree versus $t K_{m}$