Ervin Györi

124 papers C 1Journal 121Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
On graphs without cycles of length 0 modulo 4.
J. Comb. Theory B
Ervin Györi, Binlong Li, Nika Salia, Casey Tompkins, Kitti Varga, Manran Zhu
2026 J jnl
The anti-Ramsey numbers of cliques in complete multi-partite graphs.
Discret. Math.
Yuyu An, Ervin Györi, Binlong Li
2026 J jnl
The maximum Wiener index of a uniform hypergraph.
Discret. Math.
Stijn Cambie, Ervin Györi, Nika Salia, Casey Tompkins, James Tuite
2026 J jnl
The planar Turán number of Θ6-graphs.
Discret. Math.
David Guan, Ervin Györi, Diep Luong-Le, Felicia Wang, Mengyuan Yang
2025 J jnl
A note on universal graphs for spanning trees.
Discret. Appl. Math.
Ervin Györi, Binlong Li, Nika Salia, Casey Tompkins
2025 J jnl
Covering the edges of a graph with triangles.
Discret. Math.
Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang
2025 J jnl
Exact Results for Generalized Extremal Problems Forbidding an Even Cycle.
J. Graph Theory
Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
2025 J jnl
Linear three-uniform hypergraphs with no Berge path of given length.
J. Comb. Theory B
Ervin Györi, Nika Salia
2025 — conf
On the Small Quasi-kernel Conjecture - A Survey.
Information Theory and Related Fields
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2025 J jnl
On the rainbow planar Turán number of paths.
Discret. Math.
Ervin Györi, Ryan R. Martin, Addisu Paulos, Casey Tompkins, Kitti Varga
2025 J jnl
The maximum number of pentagons in a planar graph.
J. Graph Theory
Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
2024 J jnl
A New Construction for the Planar Turán Number of Cycles.
Graphs Comb.
Ervin Györi, Kitti Varga, Xiutao Zhu
2024 J jnl
Book free 3-uniform hypergraphs.
Discret. Math.
Debarun Ghosh, Ervin Györi, Judit Nagy-György, Addisu Paulos, Chuanqi Xiao, Oscar Zamora
2024 J jnl
Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb.
Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
2024 J jnl
Generalized Turán numbers for the edge blow-up of a graph.
Discret. Math.
Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
2024 J jnl
Maximum cliques in a graph without disjoint given subgraph.
Discret. Math.
Fangfang Zhang, Yaojun Chen, Ervin Györi, Xiutao Zhu
2024 J jnl
Set-sequential labelings of odd trees.
Discuss. Math. Graph Theory
Emily Eckels, Ervin Györi, Junsheng Liu, Sohaib Nasir
2024 J jnl
The Planar Turán Number of K
Graphs Comb.
Ervin Györi, Alan Li, Runtian Zhou
2024 J jnl
The maximum number of copies of an even cycle in a planar graph.
J. Comb. Theory B
Zequn Lv, Ervin Györi, Zhen He, Nika Salia, Casey Tompkins, Xiutao Zhu
2023 J jnl
Edges Not Covered by Monochromatic Bipartite Graph.
SIAM J. Discret. Math.
Xiutao Zhu, Ervin Györi, Zhen He, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga
2023 J jnl
Generalized outerplanar Turán number of short paths.
Discret. Math.
Ervin Györi, Addisu Paulos, Chuanqi Xiao
2023 J jnl
On $3$-uniform hypergraphs avoiding a cycle of length four.
Electron. J. Comb.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins
2023 J jnl
On the Small Quasi-kernel conjecture.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, Nika Salia, Mykhaylo Tyomkyn
2023 J jnl
Subgraph Densities in $K_r$-Free Graphs.
Electron. J. Comb.
Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins
2023 J jnl
The maximum number of triangles in Fk-free graphs.
Eur. J. Comb.
Xiutao Zhu, Yaojun Chen, Dániel Gerbner, Ervin Györi, Hilal Hama Karim
2023 J jnl
Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs.
Electron. J. Comb.
Chunqiu Fang, Ervin Györi, Chuanqi Xiao, Jimeng Xiao
2023 J jnl
Turán numbers of Berge trees.
Discret. Math.
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
2022 J jnl
Inverse Turán numbers.
Discret. Math.
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
2022 J jnl
On L(2, 1)-labelings of oriented graphs.
Discuss. Math. Graph Theory
Lucas Colucci, Ervin Györi
2022 J jnl
On L(2, 1)-labelings of some products of oriented cycles.
Math. Found. Comput.
Lucas Colucci, Ervin Györi
2022 J jnl
Planar Turán Number of the 6-Cycle.
SIAM J. Discret. Math.
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Chuanqi Xiao
2022 J jnl
The Turán number of the triangular pyramid of 3-layers.
Discret. Appl. Math.
Debarun Ghosh, Ervin Györi, Addisu Paulos, Chuanqi Xiao, Oscar Zamora
2022 J jnl
The maximum number of induced C 5 's in a planar graph.
J. Graph Theory
Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora
2022 J jnl
The maximum number of paths of length three in a planar graph.
J. Graph Theory
Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
2021 J jnl
Connected hypergraphs without long Berge-paths.
Eur. J. Comb.
Ervin Györi, Nika Salia, Oscar Zamora
2021 J jnl
Generalized Planar Turán Numbers.
Electron. J. Comb.
Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora
2021 J jnl
Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain.
Electron. J. Comb.
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2021 J jnl
On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs.
Graphs Comb.
Chunqiu Fang, Ervin Györi, Jimeng Xiao
2021 J jnl
On the anti-Ramsey number of forests.
Discret. Appl. Math.
Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao
2021 J jnl
The Exact Linear Turán Number of the Sail.
Electron. J. Comb.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2021 J jnl
The anti-Ramsey numbers of
Discret. Math.
Chunqiu Fang, Ervin Györi, Binlong Li, Jimeng Xiao
2021 J jnl
The maximum number of paths of length four in a planar graph.
Discret. Math.
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora
2021 J jnl
The structure of hypergraphs without long Berge cycles.
J. Comb. Theory B
Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora
2021 J jnl
Wiener index of quadrangulation graphs.
Discret. Appl. Math.
Ervin Györi, Addisu Paulos, Chuanqi Xiao
2020 J jnl
3-Uniform Hypergraphs without a Cycle of Length Five.
Electron. J. Comb.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2020 J jnl
Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2.
Comb. Probab. Comput.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Oscar Zamora
2020 J jnl
Clique coverings and claw-free graphs.
Eur. J. Comb.
Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza
2020 J jnl
Cycle Traversability for Claw-Free Graphs and Polyhedral Maps.
Comb.
Ervin Györi, Michael D. Plummer, Dong Ye, Xiaoya Zha
2020 J jnl
Edge colorings of graphs without monochromatic stars.
Discret. Math.
Lucas Colucci, Ervin Györi, Abhishek Methuku
2020 J jnl
Generalized Turán problems for even cycles.
J. Comb. Theory B
Dániel Gerbner, Ervin Györi, Abhishek Methuku, Máté Vizer
2020 J jnl
Optimal Pebbling Number of the Square Grid.
Graphs Comb.
Ervin Györi, Gyula Y. Katona, László F. Papp
2020 J jnl
The maximum Wiener index of maximal planar graphs.
J. Comb. Optim.
Debarun Ghosh, Ervin Györi, Addisu Paulos, Nika Salia, Oscar Zamora
2019 J jnl
A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing.
CoRR
Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei, István Miklós, Daniel Soltész
2019 J jnl
A note on the maximum number of triangles in a C5-free graph.
J. Graph Theory
Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi
2019 J jnl
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs.
J. Comb. Theory A
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2019 J jnl
Mobile versus Point Guards.
Discret. Comput. Geom.
Ervin Györi, Tamás Róbert Mezei
2019 J jnl
On the Rainbow Turán number of paths.
Electron. J. Comb.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2019 J jnl
Optimal pebbling and rubbling of graphs with given diameter.
Discret. Appl. Math.
Ervin Györi, Gyula Y. Katona, László F. Papp
2019 J jnl
Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs.
Theor. Comput. Sci.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2019 J jnl
The maximum number of P
Discret. Math. Theor. Comput. Sci.
Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora
2019 J jnl
The optimal pebbling number of staircase graphs.
Discret. Math.
Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins
2019 J jnl
Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle.
Comb. Probab. Comput.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2018 J jnl
3-Uniform Hypergraphs and Linear Cycles.
SIAM J. Discret. Math.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2018 J jnl
A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy.
Electron. J. Comb.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2018 J jnl
An Erdős-Gallai type theorem for uniform hypergraphs.
Eur. J. Comb.
Akbar Davoodi, Ervin Györi, Abhishek Methuku, Casey Tompkins
2018 J jnl
On the Turán number of some ordered even cycles.
Eur. J. Comb.
Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer
2018 J jnl
On the maximum size of connected hypergraphs without a path of given length.
Discret. Math.
Ervin Györi, Abhishek Methuku, Nika Salia, Casey Tompkins, Máté Vizer
2018 J jnl
Terminal-pairability in complete bipartite graphs.
Discret. Appl. Math.
Lucas Colucci, Péter L. Erdös, Ervin Györi, Tamás Róbert Mezei
2017 J jnl
3-uniform hypergraphs and linear cycles.
Electron. Notes Discret. Math.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku
2017 J jnl
A note on the maximum number of triangles in a C
Electron. Notes Discret. Math.
Beka Ergemlidze, Ervin Györi, Abhishek Methuku, Nika Salia
2017 J jnl
Constructions for the Optimal Pebbling of Grids.
Period. Polytech. Electr. Eng. Comput. Sci.
Ervin Györi, Gyula Y. Katona, László F. Papp
2017 J jnl
Mobile vs. point guards.
CoRR
Ervin Györi, Tamás Róbert Mezei
2017 J jnl
Note on terminal-pairability in complete grid graphs.
Discret. Math.
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
2017 J jnl
On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.
Comb.
Ervin Györi, Balázs Keszegh
2017 J jnl
On the number of edge-disjoint triangles in K
Electron. Notes Discret. Math.
Ervin Györi, Balázs Keszegh
2016 J jnl
A list version of graph packing.
Discret. Math.
Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager
2016 J jnl
Hypergraph extensions of the Erdős-Gallai Theorem.
Eur. J. Comb.
Ervin Györi, Gyula Y. Katona, Nathan Lemons
2016 J jnl
Making a C
Discret. Appl. Math.
Ervin Györi, Scott Kensell, Casey Tompkins
2016 J jnl
Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem.
Comput. Geom.
Ervin Györi, Tamás Róbert Mezei
2015 C conf
Optimal pebbling of grids.
CTW
Ervin Györi, Gyula Y. Katona, László F. Papp
2015 J jnl
Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem.
CoRR
Ervin Györi, Tamás Róbert Mezei
2014 J jnl
Preface.
Eur. J. Comb.
Ervin Györi, Jaroslav Nesetril, Attila Sali
2012 J jnl
3-uniform hypergraphs avoiding a given odd cycle.
Comb.
Ervin Györi, Nathan Lemons
2012 J jnl
Efficient algorithms for the periodic subgraphs mining problem.
J. Discrete Algorithms
Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi
2012 J jnl
Hypergraphs with No Cycle of a Given Length.
Comb. Probab. Comput.
Ervin Györi, Nathan Lemons
2012 J jnl
Hypergraphs with no cycle of length 4.
Discret. Math.
Ervin Györi, Nathan Lemons
2012 J jnl
The Maximum Number of Triangles in
Comb. Probab. Comput.
Ervin Györi, Hao Li
2011 J jnl
Coloring vertices and edges of a graph by nonempty subsets of a set.
Eur. J. Comb.
Paul N. Balister, Ervin Györi, Richard H. Schelp
2011 J jnl
Preface.
Electron. Notes Discret. Math.
Jarik Nesetril, Ervin Györi, Attila Sali
2010 J jnl
Cyclability in k-connected K
Discret. Math.
Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu
2010 J jnl
Hypergraph Extensions of the Erdos-Gallai Theorem.
Electron. Notes Discret. Math.
Ervin Györi, Gyula Y. Katona, Nathan Lemons
2010 J jnl
On a problem of Erdos on integers, none of which divides the product of k others.
Eur. J. Comb.
Tsz Ho Chan, Ervin Györi, András Sárközy
2009 J jnl
A new type of edge-derived vertex coloring.
Discret. Math.
Ervin Györi, Cory Palmer
2009 J jnl
Hypergraphs with no odd cycle of given length.
Electron. Notes Discret. Math.
Ervin Györi, Nathan Lemons
2008 J jnl
Connected graphs without long paths.
Discret. Math.
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2008 J jnl
General neighbour-distinguishing index of a graph.
Discret. Math.
Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak
2008 J jnl
Guest Editors' Foreword.
Discret. Math.
Zoltán Füredi, Ervin Györi, János Pach, Attila Sali
2008 J jnl
Pentagons vs. triangles.
Discret. Math.
Béla Bollobás, Ervin Györi
2007 J jnl
Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discret. Math.
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2006 J jnl
Triangle-Free Hypergraphs.
Comb. Probab. Comput.
Ervin Györi
2005 J jnl
An extremal problem concerning graphs not containing
Discret. Math.
Ervin Györi, Yoomi Rho
2004 J jnl
Longest Paths in Circular Arc Graphs.
Comb. Probab. Comput.
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2003 J jnl
Nearly bipartite graphs.
Discret. Math.
Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
2002 J jnl
Two-edge colorings of graphs with bounded degree in both colors.
Discret. Math.
Ervin Györi, Richard H. Schelp
2001 J jnl
On the Strong Product of a k-Extendable and an l-Extendable Graph.
Graphs Comb.
Ervin Györi, Wilfried Imrich
2000 J jnl
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb.
Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
1999 J jnl
How to make a graph four-connected.
Math. Program.
Ervin Györi, Tibor Jordán
1997 J jnl
C
Discret. Math.
Ervin Györi
1997 J jnl
Graphs without short odd cycles are nearly bipartite.
Discret. Math.
Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
1996 J jnl
Generalized Guarding and Partitioning for Rectilinear Polygons.
Comput. Geom.
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
1994 — conf
Generalized Guarding and Partitioning for Rectilinear Polygons.
CCCG
Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer
1992 J jnl
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.
Discret. Math.
Ervin Györi, Michael D. Plummer
1991 J jnl
An Extremal Problem on Sparse 0-1 Matrices.
SIAM J. Discret. Math.
Daniel Bienstock, Ervin Györi
1991 J jnl
On the maximal number of certain subgraphs in
Graphs Comb.
Ervin Györi, János Pach, Miklós Simonovits
1991 J jnl
On the number of edge disjoint cliques in graphs of given size.
Comb.
Ervin Györi
1989 J jnl
On the number of C
Comb.
Ervin Györi
1988 J jnl
Average distance in graphs with removed elements.
J. Graph Theory
Daniel Bienstock, Ervin Györi
1986 J jnl
The number of small semispaces of a finite set of points in the plane.
J. Comb. Theory A
Noga Alon, Ervin Györi
1985 J jnl
Covering simply connected regions by rectangles.
Comb.
Ervin Györi
1984 J jnl
A minimax theorem on intervals.
J. Comb. Theory B
Ervin Györi
1981 J jnl
An n-dimensional search problem with restricted questions.
Comb.
Ervin Györi
1981 J jnl
Partition conditions and vertex-connectivity of graphs.
Comb.
Ervin Györi
1978 J jnl
A theorem of the transversal theory for matroids of finite character.
Discret. Math.
Ervin Györi, Eric C. Milner
1978 J jnl
On the structures induced by bipartite graphs and infinite matroids.
Discret. Math.
Ervin Györi