E. Györi

activity

20152024

most citedAn Erdős-Gallai type theorem for uniform hypergraphs

39 citations · 93 across the 25 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

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 $k \geq 2$ the maximum number of copies of $C_{2 k}$ in an $n$ -vertex planar graph.

math.CO2022★ 2 cited

Extremal results for graphs avoiding a rainbow subgraph

Peter Frankl, Ervin Győri, Zhen He +5

We say that $k$ graphs $G_{1}, G_{2}, \dots, G_{k}$ on a common vertex set of size $n$ contain a rainbow copy of a graph $H$ if their union contains a copy of $H$ with each edge belonging t…