1 citations · 1 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2024
Minimum saturated graphs for unions of cliques
Wen-Han Zhu, Rong-Xia Hao, Zhen He
Let be a fixed graph. A graph is called {\it -saturated} if is not a subgraph of but the addition of any missing edge to results in an -subgraph. The {\it…
math.CO2022
Exact results for generalized extremal problems forbidding an even cycle
Ervin Győri, Zhen He, Zequn Lv +4
We determine the maximum number of copies of in a -free -vertex graph for all integers and sufficiently large . Moreover, for and…
math.CO2022★ 1 cited
Stability version of Dirac's theorem and its applications for generalized Turán problems
Xiutao Zhu, Ervin Győri, Zhen He +3
In 1952, Dirac proved that every -connected -vertex graph with the minimum degree contains a cycle of length at least . Here we obtain a stability ve…