Pentagons vs. triangles B Bollobás, E Győri Discrete Mathematics 308 (19), 4332-4336, 2008 | 123 | 2008 |

Hypergraph extensions of the Erdős-Gallai theorem E Győri, GY Katona, N Lemons European Journal of Combinatorics 58, 238-246, 2016 | 82* | 2016 |

Hypergraphs with no cycle of a given length E Győri, N Lemons Combinatorics, Probability and Computing 21 (1-2), 193-201, 2012 | 64 | 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 | 62 | 2008 |

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 | 60 | 2012 |

Hypergraph extensions of the Erdős-Gallai theorem E Győri, GY Katona, N Lemons European Journal of Combinatorics 58, 238-246, 2016 | 56 | 2016 |

Triangle-free hypergraphs E Győri Combinatorics, Probability and Computing 15 (1-2), 185-191, 2006 | 53 | 2006 |

Connected graphs without long paths PN Balister, E Győri, J Lehel, RH Schelp Discrete Mathematics 308 (19), 4487-4494, 2008 | 51 | 2008 |

On the number of*C*_{5}′S in a triangle-free graphE Győri Combinatorica 9 (1), 101-102, 1989 | 42 | 1989 |

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 | 40 | 2020 |

A note on the maximum number of triangles in a *C*_{5}‐free graphB Ergemlidze, A Methuku, N Salia, E Győri Journal of Graph Theory 90 (3), 227-230, 2019 | 37 | 2019 |

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 | 36 | 1992 |

On a problem of GOH Katona and T. Tarján E Győri, AV Kostochka Acta Mathematica Academiae Scientiarum Hungarica 34, 321-327, 1979 | 35 | 1979 |

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 | 33 | 2018 |

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 | 33 | 2018 |

The maximum number of copies in -free graphs E Győri, N Salia, C Tompkins, O Zamora Discrete Mathematics & Theoretical Computer Science 21, 2019 | 30 | 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 | 30 | 2019 |

Generalized Tur\'an problems for even cycles D Gerbner, E Győri, A Methuku, M Vizer arXiv preprint arXiv:1712.07079, 2017 | 30 | 2017 |

A new type of edge-derived vertex coloring E Győri, C Palmer Discrete mathematics 309 (22), 6344-6352, 2009 | 26 | 2009 |

The maximum number of pentagons in a planar graph E Győri, A Paulos, N Salia, C Tompkins, O Zamora arXiv preprint arXiv:1909.13532, 2019 | 23 | 2019 |