Publications of Győri, E.

Export all publications as EndNote XML
Győri E, Sárközy A, Chan TH. On a problem of Erdős on integers, none of which divides the product of k others. European Journal of Combinatorics. 2010;31(1):260-9.
Győri E, Palmer J. A new type of edge-derived vertex coloring. Discrete Mathematics. 2009;309(22):6344-52.
Bolyai Society Mathematical Studies. Győri E, Katona GOH, Lovász L, editors. Berlin: Springer; 2008.
Horizons of combinatorics. In: Győri E, Katona GOH, Lovász L, editors. Bolyai Society Mathematical Studies. Vol 17. Budapest: Bolyai János Matematikai Társulat; 2008. Abstract

Horizons of combinatorics

Based on papers presented at "The conference Horizons of Combinatorics during the period July 17-21, 2006 at Balatonalmádi (Lake Balaton, Hungary)
Katona GO. Forbidden inclusion patterns in the families of subsets(introducing a method). In: Győri E, Katona GOH, Lovász L, editors. Horizons of Combinatorics. Vol 17.; 2008. p. 119-40. (Bolyai Society Mathematical Studies; vol 17).
Győri E, Bollobás B. Pentagons vs. triangles. Discrete Mathematics. 2008;309(19):4332-6.
Győri E, Balister P, Lehel J, Schelp RH. Connected graphs without long paths. Discrete Mathematics. 2008;308(19):4487-94.
Győri E, Horňák M, Palmer C, Woźniak M. General neighbour-distinguishing index of a graph. Discrete Mathematics. 2008;308(5-6):827-31.
Győri E, Balister P, Lehel J, Schelp RH. Adjacent vertex distinguishing edge-colorings. SIAM Journal on Discrete Mathematics. 2007;21(1):237-50.
Bolyai Society mathematical studies. Győri E, Katona GOH, Lovász L, editors. Berlin: Springer; 2006.
More sets, graphs, and numbers : a salute to Vera Sós and András Hajnal. In: Győri E, Katona GOH, Lovász L, editors. Bolyai Society Mathematical Studies. Vol 15. Budapest: János Bolyai Mathematical Society; 2006.
Győri E. Triangle-free hypergraphs. Combinatorics, Probability and Computing. 2006;15(1-2):185-91.
Győri E, Rho Y. An extremal problem concerning graphs not containing Kt and Kt,t,t. Discrete Mathematics. 2005;303(1-3):56-64.
Győri E, Lehel J, Balister P, Schelp RH. Longest paths in circular arc graphs. Combinatorics, Probability and Computing. 2004;13(3):311-7.
Győri E, Nikiforov V, Schelp RH. Nearly bipartite graphs. Discrete Mathematics. 2003;272(2-3):187-96.
Győri E, Schelp RH. Two-edge colorings of graphs with bounded degree in both colors. Discrete Mathematics. 2002;249(1-3):105-10.
Recent trends in combinatorics : the legacy of Paul Erdős. Győri E, Sós VT, editors. Cambridge, U.K.: Cambridge University Press; 2001.
Workshop on Hypergraphs (June 4-17 2001) and Conference on Hypergraphs (Gyula O.H. Katona is 60) June 7-9, 2001,. In: Győri E, editor. Budapest: Alfréd Rényi Institute of Mathematics; 2001. Abstract

Workshop on Hypergraphs (June 4-17 2001) and Conference on Hypergraphs (Gyula O.H. Katona is 60) June 7-9, 2001,

Workshop on Hypergraphs (June 4-17 2001)and Conference on Hypergraphs (Gyula O.H. Katona is 60)June 7-9, 2001,Rényi Institute, Budapest, Hungary As a part of the workshop, from 11 to 13 June a Hungarian-Korean miniworkshop with about 12 Korean participants.
Győri E, Plummer MD. A nine-vertex theorem for 3-connected claw-free graphs. In: Workshop on Hypergraphs (June 4-17 2001) and Conference on Hypergraphs (Gyula O.H. Katona is 60) June 7-9, 2001. Budapest: Rényi Institute; 2001. p. 79-89. Abstract

A nine-vertex theorem for 3-connected claw-free graphs

Workshop on Hypergraphs (June 4-17 2001)and Conference on Hypergraphs (Gyula O.H. Katona is 60)June 7-9, 2001,Rényi Institute, Budapest, Hungary
Győri E, Imrich W. On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs and Combinatorics. 2001;17(2):245-53.
Győri E, Plummer MD. A nine vertex theorem for 3-connected claw- free graphs. Studia Scientiarum Mathematicarum Hungarica. 2001;38(1-4):233-44.
Győri E, Egawa Y, Faudree RJ, Ishigami Y, Schelp RH, Wang H. Vertex-Disjoint Cycles Containing Specified Edges. Graphs and Combinatorics. 2000;16(1):81-92.
Combinatorics, probability & computing. Győri E, Erdős P, Sós VT, editors. Cambridge: Cambridge University Press; 1999.
Győri E. Recent trends in combinatorics. In: Invited papers from the Matrahaza Workshop on Recent Trends in Combinatorics : dedicated to Paul Erdos. Cambridge: Cambridge University Press; 1999.
Győri E, Jordán T. How to make a graph four-connected. Mathematical Programming. 1999;84(3):555-63.
Győri E. Coverings of arbitrary rectilinear regions by rectangles. In: Bárány I, Böröczki K, editors. Intuitive geometry. Budapest: Bolyai Mathematical Soc.; 1997. p. 339-45. (Bolyai Society mathematical studies; no 6).
Győri E. C6-free bipartite graphs and product representation of squares.. 1997;165-166:371-5.
Győri E, Kostochka AV, Luczak T. Graphs without short odd cycles are nearly bipartite. Discrete Mathematics. 1997;163(1-3):279-84.
Győri E, Hoffmann F, Kriegel K, Shermer T. Generalized guarding and partitioning for rectilinear polygons. Computational Geometry. 1996;6(1):21-44.
Győri E, Faudree R, Erdős P. On the book size of graphs with large minimum degree. Studia Scientiarum Mathematicarum Hungarica. 1995;30(1-2):25-46.
Győri E. Partitions and covers of rectilinear regions. In: Frankl P, Füredi Z, Katona GOH, Miklós D, editors. Extremal problems for finite sets.; 1994. p. 289-304. (Bolyai Society mathematical studies; no 3).
Győri E. Quantitative extremal graphs on cliques and cycles (Hungarian). Matematikai Lapok. New Series. 1993;3(4):43-63.
Győri E. Edge disjoint cliques in graphs. In: Halász G, Lovász L, Miklós D, Szőnyi T, editors. Sets, graphs and numbers : a birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland; 1992. p. 357-63. (Colloquia mathematica Societatis János Bolyai; no 60).
Győri E, Erdős P, Simonovits M. How many edges should be deleted to make a triangle-free graph bipartite? In: Halász G, editor. Sets, graphs and numbers : a birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland; 1992. p. 239-63. (Colloquia mathematica Societatis János Bolyai; no 60).
Győri E, Plummer MD. The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable. Discrete Mathematics. 1992;101(1-3):87-96.
Győri E. On the number of edge disjoint cliques in graphs of given size. Combinatorica. 1991;11(3):231-43.
Győri E. An extremal problem on sparse 0-1 matrices. SIAM Journal on Discrete Mathematics. 1991;4(1):17-27.
Győri E, Pach J, Simonovits M. On the maximal number of certain subgraphs in K_r-free graphs. Graphs and Combinatorics. 1991;7(1):31-7.
Győri E. On the number of C5′S in a triangle-free graph. Combinatorica. 1989;9(1):101-2.
Győri E. On the number of edge-disjoint triangles in graphs of given size. In: Hajnal A, Lovász L, Sós VT, editors. Combinatorics. Amsterdam: North-Holland; 1988. p. 267-76. Abstract

On the number of edge-disjoint triangles in graphs of given size

The lectures of the Seventh Hungarian Colloquium on Combinatorics
Győri E. On Winkler's four-thirds conjecture on mean distance of graphs. Congressus Numerantium. A Conference Journal on Numerical Themes. 1988;(61):259-62. Abstract

On Winkler's four-thirds conjecture on mean distance of graphs

Seventeenth Manitoba Conference on Numerical Mathematics and Computing
Győri E, Bienstock D. Average distance in graphs with removed elements. Journal of Graph Theory. 1988;12(3):375-90.
Győri E, Tuza Z. Decompositions of graphs into complete subgraphs of given order. Studia scientiarum mathematicarum Hungarica. 1987;22(1-4):315-20.
Győri E. Oracle technique in lower estimation of complexity. In: Demetrovics J, Katona G, Salomaa A, editors. Algebra, combinatorics and logics in computer science. Amsterdam: North-Holland; 1986. p. 433-41.
Győri E. A short proof of the rectilinear art gallery theorem. SIAM J. Algebraic Discrete MethodsSociety for Industrial and Applied Mathematics. Journal on Algebraic and Discrete Methods. 1986;7(3):452-4.
Győri E, Alon N. The number of small semispaces of a finite set of points in the plane. Journal of combinatorial theory. Series A.. 1986:154-7.
Győri E. Covering simply connected regions by rectangles. Combinatorica. 1985;5(1):53-5.
Győri E, Erdős PL. Any four independent edges of a 4-connected graph are contained in a circuit. Acta Mathematica Hungarica. 1985;46(3-4):311-3.
Győri E, Rothschild B, Runcinski A. Every graph is contained in a sparsest possible balanced graph. Mathematical proceedings of the Cambridge Philosophical Society. 1985;98(3):397-401.
Győri E. Strong systems of representatives. In: Hajnal A, Lovasz L, Sós VT, editors. Finite and infinite sets. Amsterdam: North-Holland; 1984. p. 343-7.
Győri E. A minimax theorem on intervals. Journal of Combinatorial Theory. Series B. 1984;(1):1-9.
Győri E. Partitions of n connected graphs. In: Fiedler M, editor. Graphs and Other Combinatorial Topics. Leipzig: B.G. Teubner Verlagsgesellschaft; 1983. p. 80-5.
Győri E. On the edge numbers of graphs with hadwiger number 4 and 5. Periodica Mathematica Hungarica. 1982;13(1):21-7.
Győri E. Strongly connected digraphs with few cycles. In: Lovász L, Sós VT, editors. Algebraic methods in graph theory. Amsterdam: North-Holland; 1981. p. 251-65.
Győri E. Partition conditions and vertex-connectivity of graphs. Combinatorica. 1981;1(3):263-73.
Győri E. An n-dimensional search problem with restricted questions. Combinatorica. 1981;1(4):377-80.
Győri E, Kostochka AV. On a problem of Katona, G.O.H. and Tarján, T. Acta Mathematica Hungarica. 1979;34(3-4):321-7.
Győri E. On division of graphs to connected subgraphs. In: Hajnal A, Sós VT, editors. Combinatorics. Amsterdam ; Oxford ; New York: North-Holland Publ. Comp; 1978. p. 485-94.
Győri E, Milner EC. A theorem of the transversal theory for matroids of finite character. Discrete Mathematics. 1978;23(3):235-40.
Győri E, Milner EC. On the structures induced by bipartite graphs and infinite matroids. Discrete Mathematics. 1978;22(3):257-61.
Győri E, Turán G. Stack of pancakes. Studia Scientiarum Mathematicarum Hungarica. 1978;13(1-2):133-7.
Győri E. Végtelen matroidok összehasonlítása. Matematikai lapok : a Bolyai János Matematikai Társulat lapja. 1975;26(3-4):311-7.