Pentagons vs. triangles B Bollobás, E Győri
Discrete Mathematics 308 (19), 4332-4336, 2008
137 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
82 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
75 2012 Hypergraphs with no cycle of a given length E Győri, N Lemons
Combinatorics, Probability and Computing 21 (1-2), 193-201, 2012
73 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
65 2008 Triangle-free hypergraphs E Győri
Combinatorics, Probability and Computing 15 (1-2), 185-191, 2006
63 2006 On the number ofC 5 ′S in a triangle-free graph E Győri
Combinatorica 9 (1), 101-102, 1989
45 1989 A note on the maximum number of triangles in a C 5 ‐free graph B Ergemlidze, A Methuku, N Salia, E Győri
Journal of Graph Theory 90 (3), 227-230, 2019
42 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
40 2022 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
40 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
40 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
39 1979 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
37 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
29 2011 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
27 * 2019 On the number of edge disjoint cliques in graphs of given size E Győri
Combinatorica 11 (3), 231-243, 1991
26 1991 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
25 2020 The maximum number of E Győri, N Salia, C Tompkins, O Zamora
Discrete Mathematics & Theoretical Computer Science 21, 2019
25 2019 