2 citations · 4 across the 11 of their papers we have counts for
11 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 a…
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 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…
The maximum number of cliques in graphs with bounded odd circumference
Zequn Lv, Ervin Győri, Zhen He +3
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrate…
Edges not covered by monochromatic bipartite graphs
Xiutao Zhu, Ervin Győri, Zhen He +4
Let denote the maximum number of edges not contained in any monochromatic copy of~ in a -coloring of the edges of , and let denote the Turán number…
Generalized Turan number for the edge blow-up graph
Zequn Lv, Ervin Győri, Zhen He +4
Let be a graph and be an integer. The edge blow-up of is the graph obtained from replacing each edge in by a copy of where the new vertices of the cliqu…
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…
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…
The maximum number of copies of an even cycle in a planar graph
Zequn Lv, Ervin Győri, Zhen He +3
We resolve a conjecture of Cox and Martin by determining asymptotically for every the maximum number of copies of in an -vertex planar graph.
Extremal results for graphs avoiding a rainbow subgraph
Peter Frankl, Ervin Győri, Zhen He +5
We say that graphs on a common vertex set of size contain a rainbow copy of a graph if their union contains a copy of with each edge belonging t…