Articoli con mandati relativi all'accesso pubblico - Ervin GyoriUlteriori informazioni
Non disponibili pubblicamente: 2
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
Mandati: Hungarian Scientific Research Fund
Hypergraphs with no cycle of a given length
E Győri, N Lemons
Combinatorics, Probability and Computing 21 (1-2), 193-201, 2012
Mandati: Hungarian Scientific Research Fund
Disponibili pubblicamente: 59
Hypergraph extensions of the Erdős-Gallai theorem
E Győri, GY Katona, N Lemons
European Journal of Combinatorics 58, 238-246, 2016
Mandati: US Department of Energy, Hungarian Scientific Research Fund
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
Mandati: Magyar Tudományos Akadémia, National Office for Research, Development and …
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
Mandati: National Office for Research, Development and Innovation, Hungary
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
Mandati: National Office for Research, Development and Innovation, Hungary
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
Mandati: National Office for Research, Development and Innovation, Hungary
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
Mandati: National Office for Research, Development and Innovation, Hungary
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
Mandati: Hungarian Scientific Research Fund
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
Mandati: National Office for Research, Development and Innovation, Hungary
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
Mandati: Swiss National Science Foundation, National Office for Research, Development …
The maximum number of copies in -free graphs
E Győri, N Salia, C Tompkins, O Zamora
Discrete Mathematics & Theoretical Computer Science 21, 2019
Mandati: National Office for Research, Development and Innovation, Hungary
A new type of edge-derived vertex coloring
E Győri, C Palmer
Discrete mathematics 309 (22), 6344-6352, 2009
Mandati: Hungarian Scientific Research Fund
The structure of hypergraphs without long Berge cycles
E Győri, N Lemons, N Salia, O Zamora
Journal of Combinatorial Theory, Series B 148, 239-250, 2021
Mandati: US Department of Energy, National Office for Research, Development and …
The maximum number of P_l copies in P_k-free graphs
E Győri, N Salia, C Tompkins, O Zamora
Acta Mathematica Universitatis Comenianae 88 (3), 773-778, 2019
Mandati: National Office for Research, Development and Innovation, Hungary
On the maximum size of connected hypergraphs without a path of given length
E Győri, A Methuku, N Salia, C Tompkins, M Vizer
Discrete Mathematics 341 (9), 2602-2605, 2018
Mandati: National Office for Research, Development and Innovation, Hungary
The maximum number of paths of length four in a planar graph
D Ghosh, E Győri, RR Martin, A Paulos, N Salia, C Xiao, O Zamora
Discrete Mathematics 344 (5), 112317, 2021
Mandati: National Office for Research, Development and Innovation, Hungary
The maximum number of paths of length three in a planar graph
E Győri, A Paulos, N Salia, C Tompkins, O Zamora
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
Mandati: National Office for Research, Development and Innovation, Hungary
On the anti-Ramsey number of forests
C Fang, E Győri, M Lu, J Xiao
Discrete Applied Mathematics 291, 129-142, 2021
Mandati: National Natural Science Foundation of China, National Office for Research …
The maximum Wiener index of maximal planar graphs
D Ghosh, E Győri, A Paulos, N Salia, O Zamora
Journal of Combinatorial Optimization 40 (4), 1121-1135, 2020
Mandati: National Office for Research, Development and Innovation, Hungary
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software