Zhen He

activity

20232026

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

The saturation number of wheels

Yanzhe Qiu, Zhen He, Mei Lu +1

A graph $G$ is said to be $F$ -free, if $G$ does not contain any copy of $F$ . $G$ is said to be $F$ -semi-saturated, if the addition of any nonedge $e \neq \in E (G)$ would create a n…

math.CO2025

The Rainbow Saturation Number of Cycles

Yiduo Xu, Zhen He, Mei Lu

An edge-colored graph $(G, C)$ is $F$ -rainbow saturated if it contains no rainbow copy of $F$ , but adding any nonedge in any prescribed color creates one. The rainbow satur…