PUBLICATIONS of ERVIN GYŐRI

• Győri E: Comparison of infinite matroids, MATEMATIKAI LAPOK, 26(3-4), 311-317 (1975), (1978)
• Győri E: On division of graphs to connected subgraphs, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 485-494, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978
• Győri E: On the structures induced by bipartite graphs and infinite matroids, DISCRETE MATHEMATICS, 22(3), 257-261 (1978)
• Győri E, Milner EC: A theorem of the transversal theory for matroids of finite character, DISCRETE MATHEMATICS, 23(3), 235-240 (1978)
• Győri E, Turán Gy: Stack of pancakes, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 13(1-2), 133-137 (1978), (1981)
• Győri E, Kostochka AV: On a problem of G.O.H. Katona and T. Tarján, ACTA MATHEMATICA HUNGARICA, 34(3-4), 321-327 (1979), (1980)
• Győri E: Partition conditions and vertex-connectivity of graphs, COMBINATORICA, 1(3), 263-273 (1981)
• Győri E: Strongly connected digraphs with few cycles, Algebraic methods in graph theory, Vol. I, II (Szeged, 1978), pp. 251-265, Colloq. Math. Soc. János Bolyai, 25, North-Holland, Amsterdam-New York, 1981
• Győri E: An $n$-dimensional search problem with restricted questions, COMBINATORICA, 1(4), 377-380 (1981)
• Győri E: On the edge numbers of graphs with Hadwiger number $4$ and $5$, PERIODICA MATHEMATICA HUNGARICA, 13(1), 21-27 (1982)
• Győri E: Partitions of $n$-connected graphs, Graphs and other combinatorial topics (Prague, 1982), 80-85, Teubner-Texte Math., 59, Teubner, Leipzig, 1983
• Győri E: A minimax theorem on intervals, JOURNAL OF COMBINATORIAL THEORY SERIES B, 37(1), 1-9 (1984)
• Győri E: Strong systems of representatives, Finite and infinite sets, Vol. I, II (Eger, 1981), 343-347, Colloq. Math. Soc. János Bolyai, 37, North-Holland, Amsterdam, 1984
• Győri E: Covering simply connected regions by rectangles, COMBINATORICA, 5(1), 53-55 (1985)
• Győri E, Rothschild B, Runcinski A: Every graph is contained in a sparsest possible balanced graph, MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 98(3), 397-401 (1985)
• Erdős PL, Győri E: Any four independent edges of a $4$-connected graph are contained in a circuit, ACTA MATHEMATICA HUNGARICA, 46(3-4), 311-313 (1985)
• Alon N, Győri E: The number of small semispaces of a finite set of points in the plane, JOURNAL OF COMBINATORIAL THEORY SERIES A, 41(1), 154-157 (1986)
• Győri E: A short proof of the rectilinear art gallery theorem, SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 7(3), 452-454 (1986)
• Győri E: Oracle technique in lower estimation of complexity, Algebra, combinatorics and logic in computer science, Vol. I, II (Győr, 1983), 433-441, Colloq. Math. Soc. János Bolyai, 42, North-Holland, Amsterdam, 1986
• Győri E, Tuza Zs: Decompositions of graphs into complete subgraphs of given order, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 22(1-4), 315-320 (1987)
• Bienstock D, Győri E: Average distance in graphs with removed elements, JOURNAL OF GRAPH THEORY, 12(3), 375-390 (1988)
• Győri E: On Winkler's four-thirds conjecture on mean distance of graphs, Seventeenth Manitoba Conference on Numerical Mathematics and Computing (Winnipeg, MB, 1987), CONGRESSUS NUMERANTIUM, 61, 259-262 (1988)
• Győri E: On the number of edge-disjoint triangles in graphs of given size, Combinatorics (Eger, 1987), 267-276, Colloq. Math. Soc. János Bolyai, 52, North-Holland, Amsterdam, 1988
• Győri E: On the number of $C\sb 5$'s in a triangle-free graph, COMBINATORICA, 9(1), 101-102 (1989)
• Bienstock D, Győri E: An extremal problem on sparse $0$-$1$ matrices, SIAM JOURNAL ON DISCRETE MATHEMATICS, 4(1), 17-27 (1991)
• Győri E, Pach J, Simonovits M: On the maximal number of certain subgraphs in $K\sb r$-free graphs, GRAPHS AND COMBINATORICS, 7(1), 31-37 (1991)
• Győri E: On the number of edge disjoint cliques in graphs of given size, COMBINATORICA, 11(3), 231-243 (1991)
• Győri E, Plummer MD: 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)
• Erdős P, Győri E, Simonovits M: How many edges should be deleted to make a triangle-free graph bipartite? In: Sets, graphs and numbers (Budapest, 1991); Colloquia Mathematica Societatis János Bolyai, 60, (Eds Halász G, Lovász L, Miklós D, Szőnyi T), North-Holland, Amsterdam, 1992, pp 239-263
• Győri E: Edge disjoint cliques in graphs, In: Sets, graphs and numbers (Budapest, 1991); Colloquia Mathematica Societatis János Bolyai, 60, (Eds Halász G, Lovász L, Miklós D, Szőnyi T), North-Holland, Amsterdam, 1992, pp 357-363
• Győri E: Quantitative extremal graphs on cliques and cycles, MATEMATIKAI LAPOK-NEW SERIES, 3(4), 43-63 (1993)
• Győri E: Partitions and covers of rectilinear regions, In: Extremal Problems for Finite Sets (Visegrád, 1991); Bolyai Society Mathematical Studies, 3, (Eds Frankl P, Füredi Z, Katona GOH, Miklós D), János Bolyai Mathematical Society, Budapest, 1994, pp 289-304
• Erdős P, Faudree R, Győri E: On the book size of graphs with large minimum degree, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 30(1-2), 25-46 (1995)
• Győri E, Hoffmann F, Kriegel K, Shermer T: Generalized guarding and partitioning of rectilinear polygons, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 6(1), 21-44 (1996)
• Győri E, Kostochka AV, Luczak T: Graphs without short odd cycles are nearly bipartite, DISCRETE MATHEMATICS, 163(1-3), 279-284 (1997)
• Győri E: C6-free bipartite graphs and product representation of squares, Graphs and combinatorics (Marseille, 1995), DISCRETE MATHEMATICS, 165/166, 371-375 (1997)
• Győri E: Coverings of arbitrary rectilinear regions by rectangles, In: Intuitive Geometry, (Budapest, 1995), Bolyai Soc. Math. Studies, 6, (Eds Bárány I, Böröczky K), János Bolyai Math. Soc., Budapest, 1997, pp 339-345
• Győri E, T.Sós V (eds): Recent trends in combinatorics, Papers from the Combinatorial Workshop on Some Trends in Discrete Mathematics held in Mátraháza (Hungary), October 22-28, 1995, Combin. Probab. Comput, 8/1-2(1999), Cambridge University Press, Cambridge, 1999, p. 198
• Győri E, Jordán T: How to make a graph four-connected, In: Connectivity augmentation of networks: structures and algorithms (Budapest, 1994), MATHEMATICAL PROGRAMMING-SERIES B, 84(3), 555-563 (1999)
• Győri E, Hubenko A (eds): Gráfelmélet, 1999
• Egawa Y, Faudree RJ, Győri E, Ishigami Y, Schelp RH, Wang H: Vertex-disjoint cycles containing specified edges, GRAPHS AND COMBINATORICS, 16(1), 81-92 (2000)
• Győri E, Imrich W: On the strong product of a k-extendable and l-extendable graph, GRAPHS AND COMBINATORICS, 17(2), 245-253 (2001)
• Győri E, T.Sós V (eds): Recent trends in combinatorics, The legacy of Paul Erdős, In: Papers from the Workshop on Some Trends in Discrete Mathematics (Mátraháza, 1995), Reprint of Combin. Probab. Comput. 8(1-2), 1999, Cambridge University Press, Cambridge, 2001, p. 212
• Győri E, Plummer MD: A nine-vertex theorem for 3-connected claw-free graphs, STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 38, 233-244 (2001)
• Győri E (ed.): Proceedings of the Hungarian-Korean Workshop on Combinatorics (Gyula O.H. Katona is 60), Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, 2001, p. 251
• Győri E, Plummer MD: A nine-vertex theorem for 3-connected claw-free graphs, In: Proceedings of the Hungarian-Korean Workshop on Combinatorics, (Ed. Győri E), Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, 2001, pp 79-89
• Győri E, Schelp RH: Two-edge colorings of graphs with bounded degree in both colors, In: Combinatorics, graph theory and computing (Louisville, KY, 1999), DISCRETE MATHEMATICS, 249(1-3), 105-110 (2002)
• Győri E: 2000: a matematika nemzetközi éve, In: Közgyűlési Előadások 2000, Az MTA 175 éve, (ed. Glatz F), Magyar Tudományos Akadémia, 2002, pp 105-110
• Győri E, Nikiforov V, Schelp RH: Nearly bipartite graphs, DISCRETE MATHEMATICS, 272(2-3), 187-196 (2003)