39 citations · 93 across the 25 of their papers we have counts for
5 papers · 2 filters
Generalized Turán problems for even cycles
Dániel Gerbner, Ervin Győri, Abhishek Methuku +1
Given a graph and a set of graphs , let denote the maximum possible number of copies of in an -free graph on vertices. We i…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
Let be a family of -uniform linear hypergraphs. The linear Turán number of is the maximum possible number of edges in a -uniform linear hypergraph…
Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on t…
Terminal-Pairability in Complete Bipartite Graphs
Lucas Colucci, Péter L. Erdős, Ervin Győri +1
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. W…