4 papers
The maximum number of odd cycles in planar graphs forbidding shorter odd cycles
Yichen Wang, Ervin GyÅri, Zhen He
Given a graph and a family of graphs , the generalized planar Turán number is the maximum number of copies of in…
Turán-Type Extremal Results for Distance- Graphs
Zhen He, Nika Salia, Casey Tompkins +1
We study Turán-type extremal problems for distance graphs, motivated by work of Csikvári, Bollobás, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at dista…
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 graph…
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…