Ervin Győri

most citedAvoiding long Berge cycles, the missing cases

k = r + 1

and

k = r + 2

10 citations · 11 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2020★ 1 cited

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs

Chunqiu Fang, Ervin Győri, Binlong Li +1

A subgraph of an edge-colored graph is rainbow, if all of its edges have different colors. For a graph $G$ and a family $H$ of graphs, the anti-Ramsey number $ar(G, \math…

math.CO2020

The exact linear Turán number of the Sail

Beka Ergemlidze, Ervin Győri, Abhishek Methuku

A hypergraph is linear if any two of its edges intersect in at most one vertex. The Sail (or $3$ -fan) $F^{3}$ is the $3$ -uniform linear hypergraph consisting of $3$ edges $f_1, f_2,…

math.CO2018★ 10 cited

Avoiding long Berge cycles, the missing cases $k = r + 1$ and $k = r + 2$

Beka Ergemlidze, Ervin Győri, Abhishek Methuku +3

The maximum size of an $r$ -uniform hypergraph without a Berge cycle of length at least $k$ has been determined for all $k \geq r + 3$ by Füredi, Kostochka and Luo and for $k < r$ (and $…

The anti-Ramsey number of C3​ and C4​ in the complete r-partite graphs

The exact linear Turán number of the Sail

Avoiding long Berge cycles, the missing cases k=r+1 and k=r+2

The anti-Ramsey number of $C_{3}$ and $C_{4}$ in the complete $r$ -partite graphs

Avoiding long Berge cycles, the missing cases $k = r + 1$ and $k = r + 2$