3 citations · 8 across the 21 of their papers we have counts for
21 papers
Near-optimal Turán densities of -graphs on vertices
Jiabao Yang, Xiutao Zhu
Let be the Turán density of an r-uniform hypergraph and let denote the -uniform hypergraph on vertices with exactly edges, where . Si…
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 distance…
The Turán number of the triangular pyramid of 4-layers
Hangdi Chen, Yaojun Chen, Xiutao Zhu
The Turán number of a graph is the maximum number of edges in any -free graph on vertices. The triangular pyramid of -layers, denoted by , is a genera…
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…
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…
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…