Zian Chen

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

On saturation problems involving clique number and matching number

Zian Chen, Guorong Gao, Jianfeng Hou +1

For a clique $K_{r}$ , a graph is $K_{r}$ -saturated if it contains no copy of $K_{r}$ and the addition of any edge from its complement creates a $K_{r}$ . A classical result of Erdős-Hajnal-…

math.CO2024

Generalized Andrásfai--Erdős--Sós theorems for odd cycles

Zian Chen, Jianfeng Hou, Caiyun Hu +1

In this note, we establish Andrásfai--Erdős--Sós-type stability theorems for two generalized Turán problems involving odd cycles, both of which are extensions of the Erdős Pentagon…