Ervin Györi

2008
24	EE	Zoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)
23	EE	Béla Bollobás, Ervin Györi: Pentagons vs. triangles. Discrete Mathematics 308(19): 4332-4336 (2008)
22	EE	Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008)
21	EE	Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak: General neighbour-distinguishing index of a graph. Discrete Mathematics 308(5-6): 827-831 (2008)
2007
20	EE	Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discrete Math. 21(1): 237-250 (2007)
2006
19	EE	Ervin Györi: Triangle-Free Hypergraphs. Combinatorics, Probability & Computing 15(1-2): 185-191 (2006)
2005
18	EE	Ervin Györi, Yoomi Rho: An extremal problem concerning graphs not containing Kt and Kt, t, t. Discrete Mathematics 303(1-3): 56-64 (2005)
2004
17		Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Longest Paths in Circular Arc Graphs. Combinatorics, Probability & Computing 13(3): 311-317 (2004)
2003
16	EE	Ervin Györi, Vladimir Nikiforov, Richard H. Schelp: Nearly bipartite graphs. Discrete Mathematics 272(2-3): 187-196 (2003)
2002
15	EE	Ervin Györi, Richard H. Schelp: Two-edge colorings of graphs with bounded degree in both colors. Discrete Mathematics 249(1-3): 105-110 (2002)
2001
14	EE	Ervin Györi, Wilfried Imrich: On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs and Combinatorics 17(2): 245-253 (2001)
1997
13	EE	Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak: Graphs without short odd cycles are nearly bipartite. Discrete Mathematics 163(1-3): 279-284 (1997)
12	EE	Ervin Györi: C6-free bipartite graphs and product representation of squares. Discrete Mathematics 165-166: 371-375 (1997)
1996
11		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. Comput. Geom. 6: 21-44 (1996)
1994
10		Ervin Györi, Frank Hoffmann, Klaus Kriegel, Thomas C. Shermer: Generalized Guarding and Partitioning for Rectilinear Polygons. CCCG 1994: 302-307
1992
9	EE	Ervin Györi, Michael D. Plummer: The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discrete Mathematics 101(1-3): 87-96 (1992)
1991
8		Ervin Györi: On the number of edge disjoint cliques in graphs of given size. Combinatorica 11(3): 231-243 (1991)
7		Daniel Bienstock, Ervin Györi: An Extremal Problem on Sparse 0-1 Matrices. SIAM J. Discrete Math. 4(1): 17-27 (1991)
1989
6		Ervin Györi: On the number of C5's in a triangle-free graph. Combinatorica 9(1): 101-102 (1989)
1986
5	EE	Noga Alon, Ervin Györi: The number of small semispaces of a finite set of points in the plane. J. Comb. Theory, Ser. A 41(1): 154-157 (1986)
1985
4		Ervin Györi: Covering simply connected regions by rectangles. Combinatorica 5(1): 53-55 (1985)
1984
3	EE	Ervin Györi: A minimax theorem on intervals. J. Comb. Theory, Ser. B 37(1): 1-9 (1984)
1981
2		Ervin Györi: Partition conditions and vertex-connectivity of graphs. Combinatorica 1(3): 263-273 (1981)
1		Ervin Györi: An n-dimensional search problem with restricted questions. Combinatorica 1(4): 377-380 (1981)

Coauthor Index

1	Noga Alon	[5]
2	Paul N. Balister (Paul Balister)	[17] [20] [22]
3	Daniel Bienstock	[7]
4	Béla Bollobás	[23]
5	Zoltán Füredi	[24]
6	Frank Hoffmann	[10] [11]
7	Mirko Hornák	[21]
8	Wilfried Imrich	[14]
9	Alexandr V. Kostochka	[13]
10	Klaus Kriegel	[10] [11]
11	Jenö Lehel (Jeno Lehel)	[17] [20] [22]
12	Tomasz Luczak	[13]
13	Vladimir Nikiforov	[16]
14	János Pach	[24]
15	Cory Palmer	[21]
16	Michael D. Plummer	[9]
17	Yoomi Rho	[18]
18	Attila Sali	[24]
19	Richard H. Schelp	[15] [16] [17] [20] [22]
20	Thomas C. Shermer	[10] [11]
21	Mariusz Wozniak	[21]

Colors in the list of coauthors