3 citations · 8 across the 21 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
The Connected Bipartite Turán Problem for Long Cycles and Paths
Zhen He, Nika Salia, Xiutao Zhu
Caro, Patkós, and Tuza initiated a systematic study of the bipartite Turán number for trees, and in particular asked for the extremal number of edges in connected bipartite graphs…
math.CO2025
Sets avoiding a rainbow solution to the generalized Schur equation
Ervin Győri, Zhen He, Zequn Lv +4
A classical result in combinatorial number theory states that the largest subset of avoiding a solution to the equation is of size . For all intege…
math.CO2025
Turán problems for suspension of a balanced tree
Xiutao Zhu, Xiaolin Wang, Yanbo Zhang +1
The Turán number $\ex(n,H)$ is the maximum number of edges that an -vertex -free graph can have. The suspension is obtained from by adding a new vertex whic…