Ervin Györi

ORCID

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 66

Top Venues

Publications

Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
Generalized Turán numbers for the edge blow-up of a graph. Discret. Math. 347 (1) (2024)
Fangfang Zhang, Yaojun Chen, Ervin Györi, Xiutao Zhu
Maximum cliques in a graph without disjoint given subgraph. Discret. Math. 347 (4) (2024)
Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
Extremal Results for Graphs Avoiding a Rainbow Subgraph. Electron. J. Comb. 31 (1) (2024)
Debarun Ghosh, Ervin Györi, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora
Book free 3-uniform hypergraphs. Discret. Math. 347 (3) (2024)
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
Turán numbers of Berge trees. Discret. Math. 346 (4) (2023)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
On the Small Quasi-kernel conjecture. CoRR (2023)
Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim
The maximum number of triangles in Fk-free graphs. Eur. J. Comb. 114 (2023)
Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga
Edges Not Covered by Monochromatic Bipartite Graph. SIAM J. Discret. Math. 37 (4) (2023)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins
On $3$-uniform hypergraphs avoiding a cycle of length four. Electron. J. Comb. 30 (4) (2023)
Ervin Györi, Addisu Paulos, Chuanqi Xiao
Generalized outerplanar Turán number of short paths. Discret. Math. 346 (1) (2023)
Chunqiu Fang, Ervin Györi, Chuanqi Xiao, Jimeng Xiao
Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs. Electron. J. Comb. 30 (2) (2023)
Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins
Subgraph Densities in $K_r$-Free Graphs. Electron. J. Comb. 30 (1) (2023)
Lucas Colucci, Ervin Györi
On L(2, 1)-labelings of some products of oriented cycles. Math. Found. Comput. 5 (1) (2022)
Debarun Ghosh, Ervin Györi, Addisu Paulos, Chuanqi Xiao, Oscar Zamora
The Turán number of the triangular pyramid of 3-layers. Discret. Appl. Math. 317 (2022)
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
Inverse Turán numbers. Discret. Math. 345 (5) (2022)
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Chuanqi Xiao
Planar Turán Number of the 6-Cycle. SIAM J. Discret. Math. 36 (3) (2022)
Lucas Colucci, Ervin Györi
On L(2, 1)-labelings of oriented graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
The maximum number of paths of length three in a planar graph. J. Graph Theory 101 (3) (2022)
Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora
The maximum number of induced C 5 's in a planar graph. J. Graph Theory 99 (3) (2022)
Chunqiu Fang, Ervin Györi, Binlong Li, Jimeng Xiao
-partite graphs. Discret. Math. 344 (11) (2021)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. Electron. J. Comb. 28 (3) (2021)
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora
The maximum number of paths of length four in a planar graph. Discret. Math. 344 (5) (2021)
Ervin Györi, Addisu Paulos, Chuanqi Xiao
Wiener index of quadrangulation graphs. Discret. Appl. Math. 289 (2021)
Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao
On the anti-Ramsey number of forests. Discret. Appl. Math. 291 (2021)
Chunqiu Fang, Ervin Györi, Jimeng Xiao
On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs. Graphs Comb. 37 (6) (2021)
Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
Generalized Planar Turán Numbers. Electron. J. Comb. 28 (4) (2021)
Ervin Györi, Nika Salia, Oscar Zamora
Connected hypergraphs without long Berge-paths. Eur. J. Comb. 96 (2021)
Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora
The structure of hypergraphs without long Berge cycles. J. Comb. Theory, Ser. B 148 (2021)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
The Exact Linear Turán Number of the Sail. Electron. J. Comb. 28 (4) (2021)
Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. Comb. 40 (3) (2020)
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
Generalized Turán problems for even cycles. J. Comb. Theory, Ser. B 145 (2020)
Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza
Clique coverings and claw-free graphs. Eur. J. Comb. 88 (2020)
Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora
The maximum Wiener index of maximal planar graphs. J. Comb. Optim. 40 (4) (2020)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal Pebbling Number of the Square Grid. Graphs Comb. 36 (3) (2020)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-Uniform Hypergraphs without a Cycle of Length Five. Electron. J. Comb. 27 (2) (2020)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. Comb. Probab. Comput. 29 (3) (2020)
Lucas Colucci, Ervin Györi, Abhishek Methuku
Edge colorings of graphs without monochromatic stars. Discret. Math. 343 (12) (2020)
Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins
The optimal pebbling number of staircase graphs. Discret. Math. 342 (7) (2019)
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. CoRR (2019)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal pebbling and rubbling of graphs with given diameter. Discret. Appl. Math. 266 (2019)
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
-free graphs. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. J. Comb. Theory, Ser. A 163 (2019)
Ervin Györi, Tamás Róbert Mezei
Mobile versus Point Guards. Discret. Comput. Geom. 61 (2) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. Comb. Probab. Comput. 28 (2) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
On the Rainbow Turán number of paths. Electron. J. Comb. 26 (1) (2019)
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. Theor. Comput. Sci. 775 (2019)
Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90 (3) (2019)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-Uniform Hypergraphs and Linear Cycles. SIAM J. Discret. Math. 32 (2) (2018)
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
Terminal-pairability in complete bipartite graphs. Discret. Appl. Math. 236 (2018)
Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer
On the maximum size of connected hypergraphs without a path of given length. Discret. Math. 341 (9) (2018)
Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins
An Erdős-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69 (2018)
Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
On the Turán number of some ordered even cycles. Eur. J. Comb. 73 (2018)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. Electron. J. Comb. 25 (2) (2018)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
3-uniform hypergraphs and linear cycles. Electron. Notes Discret. Math. 61 (2017)
Ervin Györi, Balázs Keszegh
-free graphs. Electron. Notes Discret. Math. 61 (2017)
Ervin Györi, Balázs Keszegh
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. Comb. 37 (6) (2017)
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia
-free graph. Electron. Notes Discret. Math. 61 (2017)
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
Note on terminal-pairability in complete grid graphs. Discret. Math. 340 (5) (2017)
Ervin Györi, Tamás Róbert Mezei
Mobile vs. point guards. CoRR (2017)
Ervin Györi, Gyula Y. Katona, László F. Papp
Constructions for the Optimal Pebbling of Grids. Period. Polytech. Electr. Eng. Comput. Sci. 61 (2) (2017)
Ervin Györi, Gyula Y. Katona, Nathan Lemons
Hypergraph extensions of the Erdős-Gallai Theorem. Eur. J. Comb. 58 (2016)
Ervin Györi, Scott Kensell, Casey Tompkins
-free and bipartite. Discret. Appl. Math. 209 (2016)
Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
A list version of graph packing. Discret. Math. 339 (8) (2016)
Ervin Györi, Tamás Róbert Mezei
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem. Comput. Geom. 59 (2016)
Ervin Györi, Tamás Róbert Mezei
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem. CoRR (2015)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal pebbling of grids. CTW (2015)
Ervin Györi, Jaroslav Nesetril, Attila Sali
Preface. Eur. J. Comb. 35 (2014)
Ervin Györi, Nathan Lemons
Hypergraphs with no cycle of length 4. Discret. Math. 312 (9) (2012)
Ervin Györi, Nathan Lemons
3-uniform hypergraphs avoiding a given odd cycle. Comb. 32 (2) (2012)
Ervin Györi, Nathan Lemons
Hypergraphs with No Cycle of a Given Length. Comb. Probab. Comput. 21 (1-2) (2012)
Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17 (2012)
Ervin Györi, Hao Li
-Free Graphs. Comb. Probab. Comput. 21 (1-2) (2012)
Jarik Nesetril, Ervin Györi, Attila Sali
Preface. Electron. Notes Discret. Math. 38 (2011)
Paul N. Balister, Ervin Györi, Richard H. Schelp
Coloring vertices and edges of a graph by nonempty subsets of a set. Eur. J. Comb. 32 (4) (2011)
Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu
-free graphs. Discret. Math. 310 (20) (2010)
Ervin Györi, Gyula Y. Katona, Nathan Lemons
Hypergraph Extensions of the Erdos-Gallai Theorem. Electron. Notes Discret. Math. 36 (2010)
Tsz Ho Chan, Ervin Györi, András Sárközy
On a problem of Erdos on integers, none of which divides the product of k others. Eur. J. Comb. 31 (1) (2010)
Ervin Györi, Cory Palmer
A new type of edge-derived vertex coloring. Discret. Math. 309 (22) (2009)
Ervin Györi, Nathan Lemons
Hypergraphs with no odd cycle of given length. Electron. Notes Discret. Math. 34 (2009)
Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
General neighbour-distinguishing index of a graph. Discret. Math. 308 (5-6) (2008)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Connected graphs without long paths. Discret. Math. 308 (19) (2008)
Béla Bollobás, Ervin Györi
Pentagons vs. triangles. Discret. Math. 308 (19) (2008)
Zoltán Füredi, Ervin Györi, János Pach, Attila Sali
Guest Editors' Foreword. Discret. Math. 308 (19) (2008)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21 (1) (2007)
Ervin Györi
Triangle-Free Hypergraphs. Comb. Probab. Comput. 15 (1-2) (2006)
Ervin Györi, Yoomi Rho
. Discret. Math. 303 (1-3) (2005)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13 (3) (2004)
Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
Nearly bipartite graphs. Discret. Math. 272 (2-3) (2003)
Ervin Györi, Richard H. Schelp
Two-edge colorings of graphs with bounded degree in both colors. Discret. Math. 249 (1-3) (2002)
Ervin Györi, Wilfried Imrich
On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs Comb. 17 (2) (2001)
Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16 (1) (2000)
Ervin Györi, Tibor Jordán
How to make a graph four-connected. Math. Program. 84 (3) (1999)
Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
Graphs without short odd cycles are nearly bipartite. Discret. Math. 163 (1-3) (1997)
Ervin Györi
-free bipartite graphs and product representation of squares. Discret. Math. (1997)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6 (1996)
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG (1994)
Ervin Györi, Michael D. Plummer
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discret. Math. 101 (1-3) (1992)
Ervin Györi, János Pach, Miklós Simonovits
-free graphs. Graphs Comb. 7 (1) (1991)
Ervin Györi
On the number of edge disjoint cliques in graphs of given size. Comb. 11 (3) (1991)
Daniel Bienstock, Ervin Györi
An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discret. Math. 4 (1) (1991)

Ervin Györi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ervin Györi