| Pentagons vs. triangles B Bollobás, E Győri Discrete Mathematics 308 (19), 4332-4336, 2008 | 135 | 2008 |
| Hypergraph extensions of the Erdős-Gallai theorem E Győri, GY Katona, N Lemons European Journal of Combinatorics 58, 238-246, 2016 | 94* | 2016 |
| Generalized Turán problems for even cycles D Gerbner, E Győri, A Methuku, M Vizer Journal of Combinatorial Theory, Series B 145, 169-213, 2020 | 76 | 2020 |
| The maximum number of triangles in C2k+ 1-free graphs E Győri, H Li Combinatorics, Probability and Computing 21 (1-2), 187-191, 2012 | 70 | 2012 |
| Hypergraphs with no cycle of a given length E Győri, N Lemons Combinatorics, Probability and Computing 21 (1-2), 193-201, 2012 | 70 | 2012 |
| General neighbour-distinguishing index of a graph E Győri, M Horňák, C Palmer, M Woźniak Discrete Mathematics 308 (5-6), 827-831, 2008 | 67 | 2008 |
| Connected graphs without long paths PN Balister, E Győri, J Lehel, RH Schelp Discrete Mathematics 308 (19), 4487-4494, 2008 | 61 | 2008 |
| Triangle-free hypergraphs E Győri Combinatorics, Probability and Computing 15 (1-2), 185-191, 2006 | 59 | 2006 |
| On the number ofC5′S in a triangle-free graph E Győri Combinatorica 9 (1), 101-102, 1989 | 46 | 1989 |
| An Erdős–Gallai type theorem for uniform hypergraphs A Davoodi, E Győri, A Methuku, C Tompkins European Journal of Combinatorics 69, 159-162, 2018 | 39 | 2018 |
| How many edges should be deleted to make a triangle-free graph bipartite P Erdős, E Győri, M Simonovits Sets, graphs and numbers, Colloq. Math. Soc. János Bolyai 60, 239-263, 1992 | 39 | 1992 |
| A note on the maximum number of triangles in a C5‐free graph B Ergemlidze, A Methuku, N Salia, E Győri Journal of Graph Theory 90 (3), 227-230, 2019 | 38 | 2019 |
| Planar Turán number of the 6-cycle D Ghosh, E Gyori, RR Martin, A Paulos, C Xiao SIAM Journal on Discrete Mathematics 36 (3), 2028-2050, 2022 | 37 | 2022 |
| On a problem of GOH Katona and T. Tarján E Győri, AV Kostochka Acta Mathematica Academiae Scientiarum Hungarica 34, 321-327, 1979 | 36 | 1979 |
| The maximum number of copies in -free graphs E Győri, N Salia, C Tompkins, O Zamora Discrete Mathematics & Theoretical Computer Science 21, 2019 | 34 | 2019 |
| Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs B Ergemlidze, E Győri, A Methuku Journal of Combinatorial Theory, Series A 163, 163-181, 2019 | 34 | 2019 |
| Coloring vertices and edges of a graph by nonempty subsets of a set PN Balister, E Győri, RH Schelp European Journal of Combinatorics 32 (4), 533-537, 2011 | 26 | 2011 |
| The maximum number of pentagons in a planar graph E Győri, A Paulos, N Salia, C Tompkins, O Zamora Journal of Graph Theory, 2019 | 25 | 2019 |
| A new type of edge-derived vertex coloring E Győri, C Palmer Discrete mathematics 309 (22), 6344-6352, 2009 | 25 | 2009 |
| Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2 B Ergemlidze, E Győri, A Methuku, N Salia, C Tompkins, O Zamora Combinatorics, Probability and Computing 29 (3), 423-435, 2020 | 24 | 2020 |
