On the structures induced by bipartite graphs and infinite matroids. - Ervin Györi (Discret. Math., 1978)

A theorem of the transversal theory for matroids of finite character. - Ervin Györi; Eric C. Milner (Discret. Math., 1978)

Partition conditions and vertex-connectivity of graphs. - Ervin Györi (Comb., 1981)

An n-dimensional search problem with restricted questions. - Ervin Györi (Comb., 1981)

A minimax theorem on intervals. - Ervin Györi (J. Comb. Theory B, 1984)

Covering simply connected regions by rectangles. - Ervin Györi (Comb., 1985)

The number of small semispaces of a finite set of points in the plane. - Noga Alon; Ervin Györi (J. Comb. Theory A, 1986)

Average distance in graphs with removed elements. - Daniel Bienstock; Ervin Györi (J. Graph Theory, 1988)

On the number of C5's in a triangle-free graph. - Ervin Györi (Comb., 1989)

On the number of edge disjoint cliques in graphs of given size. - Ervin Györi (Comb., 1991)

On the maximal number of certain subgraphs inKr-free graphs. - Ervin Györi; János Pach; Miklós Simonovits (Graphs Comb., 1991)

An Extremal Problem on Sparse 0-1 Matrices. - Daniel Bienstock; Ervin Györi (SIAM J. Discret. Math., 1991)

The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. - Ervin Györi; Michael D. Plummer (Discret. Math., 1992)

Generalized Guarding and Partitioning for Rectilinear Polygons. - Ervin Györi; Frank Hoffmann 002; Klaus Kriegel; Thomas C. Shermer (Comput. Geom., 1996)

C6-free bipartite graphs and product representation of squares. - Ervin Györi (Discret. Math., 1997)

Graphs without short odd cycles are nearly bipartite. - Ervin Györi; Alexandr V. Kostochka; Tomasz Luczak 001 (Discret. Math., 1997)

How to make a graph four-connected. - Ervin Györi; Tibor Jordán (Math. Program., 1999)

Vertex-Disjoint Cycles Containing Specified Edges. - Yoshimi Egawa; Ralph J. Faudree; Ervin Györi; Yoshiyasu Ishigami; Richard H. Schelp; Hong Wang 005 (Graphs Comb., 2000)

On the Strong Product of a k-Extendable and an l-Extendable Graph. - Ervin Györi; Wilfried Imrich (Graphs Comb., 2001)

Two-edge colorings of graphs with bounded degree in both colors. - Ervin Györi; Richard H. Schelp (Discret. Math., 2002)

Nearly bipartite graphs. - Ervin Györi; Vladimir Nikiforov 001; Richard H. Schelp (Discret. Math., 2003)

Longest Paths in Circular Arc Graphs. - Paul N. Balister; Ervin Györi; Jenö Lehel; Richard H. Schelp (Comb. Probab. Comput., 2004)

An extremal problem concerning graphs not containing Kt and Kt, t, t. - Ervin Györi; Yoomi Rho (Discret. Math., 2005)

Triangle-Free Hypergraphs. - Ervin Györi (Comb. Probab. Comput., 2006)

Adjacent Vertex Distinguishing Edge-Colorings. - Paul N. Balister; Ervin Györi; Jenö Lehel; Richard H. Schelp (SIAM J. Discret. Math., 2007)

Connected graphs without long paths. - Paul N. Balister; Ervin Györi; Jenö Lehel; Richard H. Schelp (Discret. Math., 2008)

Pentagons vs. triangles. - Béla Bollobás; Ervin Györi (Discret. Math., 2008)

Guest Editors' Foreword. - Zoltán Füredi; Ervin Györi; János Pach; Attila Sali (Discret. Math., 2008)

General neighbour-distinguishing index of a graph. - Ervin Györi; Mirko Hornák; Cory Palmer; Mariusz Wozniak (Discret. Math., 2008)

A new type of edge-derived vertex coloring. - Ervin Györi; Cory Palmer (Discret. Math., 2009)

Hypergraphs with no odd cycle of given length. - Ervin Györi; Nathan Lemons (Electron. Notes Discret. Math., 2009)

Cyclability in k-connected K1, 4-free graphs. - Evelyne Flandrin; Ervin Györi; Hao Li 002; Jinlong Shu (Discret. Math., 2010)

On a problem of Erdos on integers, none of which divides the product of k others. - Tsz Ho Chan; Ervin Györi; András Sárközy (Eur. J. Comb., 2010)

Hypergraph Extensions of the Erdos-Gallai Theorem. - Ervin Györi; Gyula Y. Katona; Nathan Lemons (Electron. Notes Discret. Math., 2010)

Coloring vertices and edges of a graph by nonempty subsets of a set. - Paul N. Balister; Ervin Györi; Richard H. Schelp (Eur. J. Comb., 2011)

Preface. - Jarik Nesetril; Ervin Györi; Attila Sali (Electron. Notes Discret. Math., 2011)

3-uniform hypergraphs avoiding a given odd cycle. - Ervin Györi; Nathan Lemons (Comb., 2012)

The Maximum Number of Triangles in C2k+1-Free Graphs. - Ervin Györi; Hao Li 002 (Comb. Probab. Comput., 2012)

Hypergraphs with No Cycle of a Given Length. - Ervin Györi; Nathan Lemons (Comb. Probab. Comput., 2012)

Hypergraphs with no cycle of length 4. - Ervin Györi; Nathan Lemons (Discret. Math., 2012)

Efficient algorithms for the periodic subgraphs mining problem. - Alberto Apostolico; Péter L. Erdös; Ervin Györi; Zsuzsanna Lipták; Cinzia Pizzi (J. Discrete Algorithms, 2012)

Optimal pebbling of grids. - Ervin Györi; Gyula Y. Katona; László F. Papp (CTW, 2015)

Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem. - Ervin Györi; Tamás Róbert Mezei (CoRR, 2015)

Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem. - Ervin Györi; Tamás Róbert Mezei (Comput. Geom., 2016)

Making a C6-free graph C4-free and bipartite. - Ervin Györi; Scott Kensell; Casey Tompkins (Discret. Appl. Math., 2016)

A list version of graph packing. - Ervin Györi; Alexandr V. Kostochka; Andrew McConvey; Derrek Yager (Discret. Math., 2016)

On the Number of Edge-Disjoint Triangles in K 4-Free Graphs. - Ervin Györi; Balázs Keszegh (Comb., 2017)

Mobile vs. point guards. - Ervin Györi; Tamás Róbert Mezei (CoRR, 2017)

Note on terminal-pairability in complete grid graphs. - Ervin Györi; Tamás Róbert Mezei; Gábor Mészáros (Discret. Math., 2017)

Constructions for the Optimal Pebbling of Grids. - Ervin Györi; Gyula Y. Katona; László F. Papp (Period. Polytech. Electr. Eng. Comput. Sci., 2017)

3-uniform hypergraphs and linear cycles. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. Notes Discret. Math., 2017)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia (Electron. Notes Discret. Math., 2017)

On the number of edge-disjoint triangles in K4-free graphs. - Ervin Györi; Balázs Keszegh (Electron. Notes Discret. Math., 2017)

A Note on the Linear Cycle Cover Conjecture of Gyárfás and Sárközy. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2018)

Terminal-pairability in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Discret. Appl. Math., 2018)

On the maximum size of connected hypergraphs without a path of given length. - Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Máté Vizer (Discret. Math., 2018)

An Erdős-Gallai type theorem for uniform hypergraphs. - Akbar Davoodi; Ervin Györi; Abhishek Methuku; Casey Tompkins (Eur. J. Comb., 2018)

On the Turán number of some ordered even cycles. - Ervin Györi; Dániel Korándi; Abhishek Methuku; István Tomon; Casey Tompkins; Máté Vizer (Eur. J. Comb., 2018)

On the Rainbow Turán number of paths. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2019)

A non-P-stable class of degree sequences for which the swap Markov chain is rapidly mixing. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (CoRR, 2019)

Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Comb. Probab. Comput., 2019)

Optimal pebbling and rubbling of graphs with given diameter. - Ervin Györi; Gyula Y. Katona; László F. Papp (Discret. Appl. Math., 2019)

Mobile versus Point Guards. - Ervin Györi; Tamás Róbert Mezei (Discret. Comput. Geom., 2019)

The optimal pebbling number of staircase graphs. - Ervin Györi; Gyula Y. Katona; László F. Papp; Casey Tompkins (Discret. Math., 2019)

The maximum number of Pℓ copies in Pk-free graphs. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math. Theor. Comput. Sci., 2019)

Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (J. Comb. Theory A, 2019)

A note on the maximum number of triangles in a C5-free graph. - Beka Ergemlidze; Abhishek Methuku; Nika Salia; Ervin Györi (J. Graph Theory, 2019)

Terminal-pairability in complete bipartite graphs with non-bipartite demands: Edge-disjoint paths in complete bipartite graphs. - Lucas Colucci; Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei (Theor. Comput. Sci., 2019)

Cycle Traversability for Claw-Free Graphs and Polyhedral Maps. - Ervin Györi; Michael D. Plummer; Dong Ye 002; Xiaoya Zha (Comb., 2020)

3-Uniform Hypergraphs without a Cycle of Length Five. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2020)

Avoiding long Berge cycles: the missing cases k = r + 1 and k = r + 2. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Comb. Probab. Comput., 2020)

Edge colorings of graphs without monochromatic stars. - Lucas Colucci; Ervin Györi; Abhishek Methuku (Discret. Math., 2020)

Clique coverings and claw-free graphs. - Csilla Bujtás; Akbar Davoodi; Ervin Györi; Zsolt Tuza (Eur. J. Comb., 2020)

Optimal Pebbling Number of the Square Grid. - Ervin Györi; Gyula Y. Katona; László F. Papp (Graphs Comb., 2020)

The maximum Wiener index of maximal planar graphs. - Debarun Ghosh; Ervin Györi; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Comb. Optim., 2020)

Generalized Turán problems for even cycles. - Dániel Gerbner; Ervin Györi; Abhishek Methuku; Máté Vizer (J. Comb. Theory B, 2020)

Half-Graphs, Other Non-stable Degree Sequences, and the Switch Markov Chain. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; István Miklós; Daniel Soltész (Electron. J. Comb., 2021)

The Exact Linear Turán Number of the Sail. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku (Electron. J. Comb., 2021)

Generalized Planar Turán Numbers. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Electron. J. Comb., 2021)

On the anti-Ramsey number of forests. - Chunqiu Fang; Ervin Györi; Mei Lu; Jimeng Xiao (Discret. Appl. Math., 2021)

Wiener index of quadrangulation graphs. - Ervin Györi; Addisu Paulos; Chuanqi Xiao (Discret. Appl. Math., 2021)

The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs. - Chunqiu Fang; Ervin Györi; Binlong Li; Jimeng Xiao (Discret. Math., 2021)

The maximum number of paths of length four in a planar graph. - Debarun Ghosh; Ervin Györi; Ryan R. Martin; Addisu Paulos; Nika Salia; Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2021)

Connected hypergraphs without long Berge-paths. - Ervin Györi; Nika Salia; Oscar Zamora 001 (Eur. J. Comb., 2021)

On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs. - Chunqiu Fang; Ervin Györi; Jimeng Xiao (Graphs Comb., 2021)

The structure of hypergraphs without long Berge cycles. - Ervin Györi; Nathan Lemons; Nika Salia; Oscar Zamora 001 (J. Comb. Theory B, 2021)

The Turán number of the triangular pyramid of 3-layers. - Debarun Ghosh; Ervin Györi; Addisu Paulos; Chuanqi Xiao; Oscar Zamora 001 (Discret. Appl. Math., 2022)

Inverse Turán numbers. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2022)

On L(2, 1)-labelings of oriented graphs. - Lucas Colucci; Ervin Györi (Discuss. Math. Graph Theory, 2022)

The maximum number of induced C 5 's in a planar graph. - Debarun Ghosh; Ervin Györi; Oliver Janzer; Addisu Paulos; Nika Salia; Oscar Zamora 001 (J. Graph Theory, 2022)

The maximum number of paths of length three in a planar graph. - Andrzej Grzesik; Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2022)

On L(2, 1)-labelings of some products of oriented cycles. - Lucas Colucci; Ervin Györi (Math. Found. Comput., 2022)

Planar Turán Number of the 6-Cycle. - Debarun Ghosh; Ervin Györi; Ryan R. Martin; Addisu Paulos; Chuanqi Xiao (SIAM J. Discret. Math., 2022)

On $3$-uniform hypergraphs avoiding a cycle of length four. - Beka Ergemlidze; Ervin Györi; Abhishek Methuku; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

Turán Numbers and Anti-Ramsey Numbers for Short Cycles in Complete $3$-Partite Graphs. - Chunqiu Fang; Ervin Györi; Chuanqi Xiao; Jimeng Xiao (Electron. J. Comb., 2023)

Subgraph Densities in $K_r$-Free Graphs. - Andrzej Grzesik; Ervin Györi; Nika Salia; Casey Tompkins (Electron. J. Comb., 2023)

On the Small Quasi-kernel conjecture. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (CoRR, 2023)

Generalized outerplanar Turán number of short paths. - Ervin Györi; Addisu Paulos; Chuanqi Xiao (Discret. Math., 2023)

Turán numbers of Berge trees. - Ervin Györi; Nika Salia; Casey Tompkins; Oscar Zamora 001 (Discret. Math., 2023)

The maximum number of triangles in Fk-free graphs. - Xiutao Zhu; Yaojun Chen; Dániel Gerbner; Ervin Györi; Hilal Hama Karim (Eur. J. Comb., 2023)

Edges Not Covered by Monochromatic Bipartite Graph. - Xiutao Zhu; Ervin Györi; Zhen He; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga (SIAM J. Discret. Math., 2023)

Extremal Results for Graphs Avoiding a Rainbow Subgraph. - Zhen He; Peter Frankl; Ervin Györi; Zequn Lv; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Electron. J. Comb., 2024)

Set-sequential labelings of odd trees. - Emily Eckels; Ervin Györi; Junsheng Liu; Sohaib Nasir (Discuss. Math. Graph Theory, 2024)

The maximum number of copies of an even cycle in a planar graph. - Zequn Lv; Ervin Györi; Zhen He; Nika Salia; Casey Tompkins; Xiutao Zhu (J. Comb. Theory B, 2024)

Generalized Turán numbers for the edge blow-up of a graph. - Zequn Lv; Ervin Györi; Zhen He; Nika Salia; Casey Tompkins; Kitti Varga; Xiutao Zhu (Discret. Math., 2024)

Book free 3-uniform hypergraphs. - Debarun Ghosh; Ervin Györi; Judit Nagy-György; Addisu Paulos; Chuanqi Xiao; Oscar Zamora 001 (Discret. Math., 2024)

Maximum cliques in a graph without disjoint given subgraph. - Fangfang Zhang; Yaojun Chen; Ervin Györi; Xiutao Zhu (Discret. Math., 2024)

The Planar Turán Number of K4,C5 and K4,C6. - Ervin Györi; Alan Li; Runtian Zhou (Graphs Comb., 2024)

A New Construction for the Planar Turán Number of Cycles. - Ervin Györi; Kitti Varga; Xiutao Zhu (Graphs Comb., 2024)

On the Small Quasi-kernel Conjecture - A Survey. - Péter L. Erdös; Ervin Györi; Tamás Róbert Mezei; Nika Salia; Mykhaylo Tyomkyn (Information Theory and Related Fields, 2025)

A note on universal graphs for spanning trees. - Ervin Györi; Binlong Li; Nika Salia; Casey Tompkins (Discret. Appl. Math., 2025)

Covering the edges of a graph with triangles. - Csilla Bujtás; Akbar Davoodi; Laihao Ding; Ervin Györi; Zsolt Tuza; Donglei Yang (Discret. Math., 2025)

On the rainbow planar Turán number of paths. - Ervin Györi; Ryan R. Martin; Addisu Paulos; Casey Tompkins; Kitti Varga (Discret. Math., 2025)

Linear three-uniform hypergraphs with no Berge path of given length. - Ervin Györi; Nika Salia (J. Comb. Theory B, 2025)

The maximum number of pentagons in a planar graph. - Ervin Györi; Addisu Paulos; Nika Salia; Casey Tompkins; Oscar Zamora 001 (J. Graph Theory, 2025)

The anti-Ramsey numbers of cliques in complete multi-partite graphs. - Yuyu An; Ervin Györi; Binlong Li (Discret. Math., 2026)

The planar Turán number of Θ6-graphs. - David Guan; Ervin Györi; Diep Luong-Le; Felicia Wang; Mengyuan Yang (Discret. Math., 2026)

On graphs without cycles of length 0 modulo 4. - Ervin Györi; Binlong Li; Nika Salia; Casey Tompkins; Kitti Varga; Manran Zhu (J. Comb. Theory B, 2026)