39 citations · 111 across the 33 of their papers we have counts for
4 papers · 1 filter
On -uniform hypergraphs avoiding a cycle of length four
Beka Ergemlidze, Ervin Győri, Abhishek Methuku +2
In this note we show that the maximum number of edges in a -uniform hypergraph without a Berge cycle of length four is at most . This improves…
Inverse Turán numbers
Ervin Győri, Nika Salia, Casey Tompkins +1
For given graphs and , the Turán number is defined to be the maximum number of edges in an -free subgraph of . Foucaud, Krivelevich and Perarnau and later in…
Saturation problems in the Ramsey theory of graphs, posets and point sets
Gábor Damásdi, Balázs Keszegh, David Malec +3
In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in…
Generalized Planar Turán Numbers
Ervin Győri, Addisu Paulos, Nika Salia +2
In a generalized Turán problem, we are given graphs and and seek to maximize the number of copies of in an -free graph of order . We consider generalized Turán pr…