10 papers · 1 filter
A note on the saturation number for unions of three cliques
Hanlai Lin, Zhen He, Yiduo Xu
A graph is -saturated if contains no copy of but contains a copy of for every missing edge of . The saturation number $\sat(n,F)$ is the minimum num…
All minimum -saturated multipartite graphs
Yiduo Xu, Zhen He, Mei Lu +1
A subgraph of is said to be -saturated relative to , if does not contain any copy of , but the addition of any edge in would create a…
Degree-restricted semi-saturation numbers of cliques and its applications
Zhen He, Mei Lu, Yanzhe Qiu +1
A graph is said to be -semi-saturated if the addition of any nonedge would create a new copy of in . The semi-saturation number is the…
The saturation number of wheels
Yanzhe Qiu, Zhen He, Mei Lu +1
A graph is said to be -free, if does not contain any copy of . is said to be -semi-saturated, if the addition of any nonedge would create a n…
The Rainbow Saturation Number of Cycles
Yiduo Xu, Zhen He, Mei Lu
An edge-coloring of a graph is a function . We say that is rainbow if all edges of have different colors. Given a graph , a…
Partite saturation number of cycles
Yiduo Xu, Zhen He, Mei Lu
A graph is said to be -saturated relative to , if does not contain any copy of , but the addition of any edge in would create a copy of $…