2011.

Trees in greedy colorings of hypergraphs

Authors: Gyárfás, András; Lehel, Jenő
Date: 2011.
Published by: Discrete Mathematics (Volume no.: 311, Page: 208-209 )

Long rainbow cycles in proper edge-colorings of complete graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Schelp, Richard
Date: 2011.
Published by: Australasian Journal of Combinatorics (Volume no.: 50, Page: 45-53)

2010.

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Journal of Graph Theory (Volume no.: 63, Page: 288-299.)

Gallai colorings of non-complete graphs.

Authors: Gyárfás, András; Sárközy, Gábor
Date: 2010.
Published by: Discrete Mathematics (Volume no.: 310, Page: 977-980.)

Long monochromatic Berge cycles in colored 4-uniform hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Graphs and Combinatorics (Volume no.: 26, Page: 71-76.)

Rainbow and orthogonal paths in factorizations of K_n.

Authors: Gyárfás, András; Mhalla, Mehdi
Date: 2010.
Published by: Journal of Combinatorial Designs (Volume no.: 18, Issue no.: 3, Page: 167-176.)

Monochromatic matchings in the shadow graph of almost complete hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2010.
Published by: Annals of Combinatorics (Volume no.: 14, Issue no.: 2, Page: 245-249.)

Ramsey-type results for Gallai colorings.

Authors: Gyárfás, András; Sárközy, Gábor; Sebő, András; Selkow, S.
Date: 2010.
Published by: Journal of Graph Theory (Volume no.: 64, Issue no.: 3, Page: 233-243.)

Large monochromatic components in edge coloring of graphs: A survey

Authors: Gyárfás, András
Date: 2010.
Published by: Ramsey Theory - Yesterday, today and tomorrow (Page: 77-96)

2009.

Large monochromatic components in colorings of complete 3-uniform hypergraphs.

Authors: Gyárfás, András; Haxell, Penny
Date: 2009.
Published by: Discrete Mathematics (Volume no.: 309, Page: 3156-3160.)

Stability of the path-path Ramsey number.

Authors: Gyárfás, András; Sárközy, Gábor; Szemerédi, Endre
Date: 2009.
Published by: Discrete Mathematics (Volume no.: 309, Page: 4590-4595)

Multipartite Ramsey numbers for odd cycles.

Authors: Gyárfás, András; Sárközy, Gábor; Schelp, Richard
Date: 2009.
Published by: Journal of Graph Theory (Volume no.: 61, Page: 12-21.)

2008.

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi , Endre
Date: 2008.
Published by: Combinatorica (Volume no.: 28, Issue no.: 4, Page: 499-502.)

Size of monochromatic components in local edge colorings.

Authors: Gyárfás , András; Sárközy , Gábor
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Issue no.: 12, Page: 2620-2622.)

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

Authors: Gyárfás, András; Lehel, Jenő; Sárközy, Gábor; Schelp, Richard
Date: 2008.
Published by: Journal of Combinatorial Theory. Ser. B. (Volume no.: 98, Issue no.: 2, Page: 342-358.)

Inequalities for the first-fit chromatic number.

Authors: Füredi, Zoltán; Gyárfás, András; Sárközy, Gábor; Selkow, Stanley
Date: 2008.
Published by: Journal of Graph Theory (Volume no.: 59, Page: 75-88.)

The Ramsey number of diamond matchings and loose cycles in hypergraphs.

Authors: Gyárfás, András; Sárközy, Gábor; Szemeredi , Endre
Date: 2008.
Published by: Electronic Journal of Combinatorics (Volume no.: 15, Page: #R126)

Ramsey and Turán-type problems in bipartite geometric graphs.

Authors: Gyárfás, András
Date: 2008.
Published by: Electronic Notes in Discrete Mathematics (Volume no.: 31, Page: 253-254.)

Highly connected monochromatic subgraphs.

Authors: Bollobás, Béla; Gyárfás, András
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Page: 1722-1725.)

Disjoint chorded cycles in graphs.

Authors: Bialostocki, Arie; Finkel, Daniel; Gyárfás, András
Date: 2008.
Published by: Discrete Mathematics (Volume no.: 308, Page: 5886-5890.)

Size of Monochromatic double stars in edge colorings

Authors: Gyárfás, András; Sárközy, Gábor
Date: 2008.
Published by: Graphs and Combinatorics (Volume no.: 24, Page: 531-536)

2007.

Three-color Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Combinatorica (Volume no.: 27, Issue no.: 1, Page: 35-69.)

Tripartite Ramsey numbers for paths.

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemerédi, Endre
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 55, Issue no.: 2, Page: 164-174.)

Finding a monochromatic subgraph or a rainbow path.

Authors: Gyárfás, András; Lehel, Jenő; Schelp, Richard H.
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 54, Issue no.: 1, Page: 1-12.)

Maximum directed cuts in acyclic digraphs.

Authors: Alon, Noga; Bollobás, Béla; Gyárfás, András; Lehel, Jenő; Scott, Alex
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 55, Issue no.: 1, Page: 1-13.)

Maximum directed cuts in acyclic digraphs

Authors: Bollobas, Bela; Gyárfás, András
Date: 2007.
Published by: Journal of Graph Theory (Volume no.: 55, Page: 1-13)

2006.

An improved bound for the monochromatic cycle partition number

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Date: 2006.
Published by: Journal of Combinatorial Theory Series B (Volume no.: 96, Issue no.: 6, Page: 855-873)
Download article: [pdf]

One-sided coverings of colored complete bipartite graphs

Authors: Gyárfás, András; Ruszinkó, Miklós; Sárközy, Gábor; Szemeredi, E
Editor: Klazar, M
Date: 2006.
Published by: Topics in discrete mathematics. Dedicated to Jarik Nešetril on the occasion of his 60th birthday. (Algorithms and combinatorics 26.) (Page: 133-154)

Hall ratio of the Mycielski graphs

Authors: Cropper, M; Gyárfás, András; Lehel, Jenő
Date: 2006.
Published by: Discrete Mathematics (Volume no.: 306, Issue no.: 16, Page: 1988-1990)

Odd cycles and Theta-cycles in hypergraphs

Authors: Gyárfás, András; Jacobson, M; Kezdy, A; Lehel, Jenő
Date: 2006.
Published by: Discrete Mathematics (Volume no.: 306, Issue no.: 19-20, Page: 2481-2491)

Mono-multi bipartite Ramsey numbers, designs, and matrices

Authors: Balister, P; Gyárfás, András; Lehel, Jenő; Schelp, R
Date: 2006.
Published by: Journal of Combinatorial Theory Series A (Volume no.: 113, Issue no.: 1, Page: 101-112)

2005.

Connected matchings and Hadwiger’s conjecture

Authors: Füredi, Z; Gyárfás, A; Simonyi, G
Date: 2005.
Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 14, Issue no.: 3, Page: 435-438)

Semistrong edge coloring of graphs

Authors: Gyárfás, A; Hubenko, A
Date: 2005.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 49, Issue no.: 1, Page: 39-47)

2004.

Edge colorings of complete graphs without tricolored triangles

Authors: Gyárfás, A; Simonyi, G
Date: 2004.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 46, Issue no.: 3, Page: 211-216)

On graphs with strongly independent color-classes

Authors: Gyárfás, A; Jensen, T; Stiebitz, M
Date: 2004.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 46, Issue no.: 1, Page: 1-14)

Coloring the maximal cliques of graphs

Authors: Bacsó, G; Gravier, S; Gyárfás, A; Preissmann, M; Sebő, A
Date: 2004.
Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 17, Page: 361-376)

2003.

Edge list multicoloring trees: an extension of Hall's theorem

Authors: Cropper, M; Gyárfás, A; Lehel, J
Date: 2003.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 42, Issue no.: 3, Page: 246-255)

2002.

Large cliques in C4-free graphs.

Authors: Gyárfás, A; Hubenkó, A; Solymosi, J
Date: 2002.
Published by: COMBINATORICA (Volume no.: 22, Issue no.: 2, Page: 269-274)

Erdos problems on irregularities of line sizes and point degrees. Vol II.

Authors: Gyárfás, A
Date: 2002.
Published by: Paul Erdos and his mathematics. {Bolyai Society mathematical studies 11) (Page: 367-373)

On the maximum size of (p,Q)-free families.

Authors: Füredi, Z; Gyárfás, A; Ruszinkó, M
Date: 2002.
Published by: DISCRETE MATHEMATICS (Volume no.: 257, Issue no.: 2-3, Page: 385-403)

A finite basis characterization of a-split colorings.

Authors: Gyárfás, A; Kézdy, AE; Lehel, J
Date: 2002.
Published by: DISCRETE MATHEMATICS (Volume no.: 257, Issue no.: 2-3, Page: 415-421)

Teljes gráfok felbontásairól. (Decompositions of complete graphs.) (in Hungarian)

Authors: Gyárfás, A; Hraskó, A
Date: 2002.
Published by: Új matematikai mozaik. (Page: 199-210)

2001.

Anti-Ramsey colorings in several rounds.

Authors: Blokhuis, A; Faudree, R; Gyárfás, A; Ruszinkó, M
Date: 2001.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 82, Page: 1-18)

Transitive tournaments and self-complementary graphs.

Authors: Gyárfás, A
Date: 2001.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 38, Issue no.: 2, Page: 111-112)

Convex sets in the plane with three of every four meeting.

Authors: Kleitman, DJ; Gyárfás, A; Tóth, G
Date: 2001.
Published by: COMBINATORICA (Volume no.: 21, Issue no.: 2, Page: 221-232)

2000.

Decreasing the diameter of bounded degree graphs.

Authors: Alon, N; Gyárfás, A; Ruszinkó, M
Date: 2000.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 35, Issue no.: 3, Page: 161-172)

Hypergraphs.

Authors: Gyárfás, A
Date: 2000.
Published by: Handbook of discrete and combinatorial mathematics. (Page: 595-602)

The Hall ratio of graphs and hypergraphs. (Les cahiers du Laboratoire Leibniz., No. 17.)

Authors: Cropper, M; Jacobson, MS; Gyárfás, A; Lehel, J
Date: 2000.
Published by: The Hall ratio of graphs and hypergraphs. (Les cahiers du Laboratoire Leibniz., No. 17.) (Page: 15)

1999.

Split and balanced colorings of complete graphs.

Authors: Erdős, P; Gyárfás, A
Date: 1999.
Published by: DISCRETE MATHEMATICS (Volume no.: 200, Issue no.: 1-3, Page: 79-86)

Path pairable graphs.

Authors: Faudree, RJ; Gyárfás, A; Lehel, M
Date: 1999.
Published by: THE JOURNAL of COMBINATORIAL MATHEMATICS and COMBINATORIAL COMPUTING (Volume no.: 29, Page: 145-157)

On-line 3-chromatic graphs I. Triangle free graphs.

Authors: Gyárfás, A; Király, Z; Lehel, L
Date: 1999.
Published by: SIAM JOURNAL ON DISCRETE MATHEMATICS (Volume no.: 12, Issue no.: 3, Page: 385-411)

1998.

2-partition-transitive tournaments.

Authors: Guiduli, B; Gyárfás, A; Thomassé, S; Weidl, P
Date: 1998.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 72, Issue no.: 2, Page: 181-196)

Verte colorings with a distance restriction.

Authors: Chen, G; Gyárfás, A; Schelp, RH
Date: 1998.
Published by: DISCRETE MATHEMATICS (Volume no.: 191, Issue no.: 1-3, Page: 65-82)

A communication problem and directed triple systems.

Authors: Gyárfás, A; Schelp, RH
Date: 1998.
Published by: DISCRETE APPLIED MATHEMATICS (Volume no.: 85, Issue no.: 2, Page: 139-147)

Generalized split graphs and Ramsey numbers.

Authors: Gyárfás, A
Date: 1998.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES A (Volume no.: 81, Issue no.: 2, Page: 255-261)

Nonsymmetric party problems.

Authors: Gyárfás, A
Date: 1998.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 28, Issue no.: 1, Page: 43-47)

How to decrease the diameter of triangle-free graphs.

Authors: Erdős, P; Gyárfás, A; Ruszinkó, M
Date: 1998.
Published by: COMBINATORICA (Volume no.: 18, Issue no.: 4, Page: 493-501)

1997.

Fruit salad.

Authors: Gyárfás, A
Date: 1997.
Published by: ELECTRONIC JOURNAL OF COMBINATORICS (Volume no.: 4, Issue no.: R8, Page: 1-8)

A class of edge critical 4-chromatic graphs.

Authors: Chen, G; Erdős, PL; Gyárfás, A; Schelp, RH
Date: 1997.
Published by: GRAPHS AND COMBINATORICS (Volume no.: 13, Issue no.: 2, Page: 139-146)

Reflections on a problem of Erdős and Hajnal.

Authors: Gyárfás, A
Date: 1997.
Published by: The mathematics of Paul Erdős. Vol. 2. ( Algorithms and combinatorics, 14.) (Page: 93-98)

On-line 3-chromatic graphs - II. Critical graphs.

Authors: Gyárfás, A; Király, Z; Lehel, J
Date: 1997.
Published by: DISCRETE MATHEMATICS (Volume no.: 177, Issue no.: 1-3, Page: 99-122)

A variant of the classical Ramsey problem.

Authors: Erdős, P; Gyárfás, A
Date: 1997.
Published by: COMBINATORICA (Volume no.: 17, Issue no.: 4, Page: 459-467)

The size of the largest bipartite subgraph.

Authors: Erdos, P; Kohayakawa, Y; Gyárfás, A
Date: 1997.
Published by: DISCRETE MATHEMATICS (Volume no.: 177, Issue no.: 1-3, Page: 267-271)

Monochromatic path covers in nearly complete graphs.

Authors: Gyárfás, A; Jagota, A; Schelp, RH
Date: 1997.
Published by: THE JOURNAL of COMBINATORIAL MATHEMATICS and COMBINATORIAL COMPUTING (Volume no.: 25, Page: 129-144)

1996.

Graphs in which each C4 spans K4.

Authors: Erdős, P; Gyárfás, A; Luczak, T
Date: 1996.
Published by: DISCRETE MATHEMATICS (Volume no.: 154, Issue no.: 1-3, Page: 263-268)

An edge coloring problem for graph products.

Authors: Faudree, RJ; Gyárfás, A; Schelp, RH
Date: 1996.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 23, Issue no.: 3, Page: 297-302)

Endpoint extendable paths in tournaments.

Authors: Fudree, RJ; Gyárfás, A
Date: 1996.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 23, Issue no.: 3, Page: 303-307)

Minimal non-neighbourhood perfect graphs.

Authors: Gyárfás, A; Kratsch, D; Lehel, J; Maffray, F
Date: 1996.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 21, Issue no.: 1, Page: 55-56)

Path matchings in graphs.

Authors: Faudree, RJ; Gyárfás, A
Date: 1996.
Published by: CONGRESSUS NUMERANTIUM (Volume no.: 120, Page: 83-96)

1995.

Vertex covering with monochromatic paths

Authors: Erdős, P; Gyárfás, A
Date: 1995.
Published by: MATHEMATICA PANNONICA (Volume no.: 6, Issue no.: 1, Page: 7-10)

Linear sets with five distinct differences among any four elements

Authors: Gyárfás, A; Lehel, J
Date: 1995.
Published by: JOURNAL OF COMBINATORIAL THEORY SERIES B (Volume no.: 64, Issue no.: 1, Page: 108-118)

1994.

On the rotation distance of graphs

Authors: Faudree, RJ; Schelp, RH; Lesniak, L; Gyárfás, A; Lehel, J
Date: 1994.
Published by: DISCRETE MATHEMATICS (Volume no.: 126, Issue no.: 1-3, Page: 121-135)

On a Ramsey type problem of Shelah

Authors: Gyárfás, A
Date: 1994.
Published by: Extremal problems for finite sets. Conference. Visegrád, 1991. (Bolyai Society mathematical studies 3.) (Page: 283-287)

Independent transversals in sparse partite hypergraphs

Authors: Erdős, P; Gyárfás, A; Luczak, T
Date: 1994.
Published by: COMBINATORICS PROBABILITY & COMPUTING (Volume no.: 3, Page: 293-296)

1993.

Rainbow coloring the cube

Authors: Faudree, RJ; Gyárfás, A; Lesniak, L; Schelp, RH
Date: 1993.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 17, Issue no.: 5, Page: 607-612)

On-line graph coloring and finite basis problems

Authors: Gyárfás, A; Király, Z; Lehel, J
Date: 1993.
Published by: Combinatorics, Paul Erdős is eighty. Keszthely, 1993. Vol. 1. (Page: 207-214)

1992.

Three-regular path pairable graphs

Authors: Faudree, RJ; Gyárfás, A; Lehel, J
Date: 1992.
Published by: GRAPHS AND COMBINATORICS (Volume no.: 8, Issue no.: 1, Page: 45-52)

On the irregularity strength of the m x n grid

Authors: Dinitz, JH; Garnick, DK; Gyárfás, A
Date: 1992.
Published by: JOURNAL OF GRAPH THEORY (Volume no.: 16, Issue no.: 4, Page: 355-374)

Graphs with k odd cycle lengths

Authors: Gyárfás, A
Date: 1992.
Published by: DISCRETE MATHEMATICS (Volume no.: 103, Issue no.: 1, Page: 41-48)

Irregularity strength of uniform hypergraphs

Authors: Gyárfás, A; Jacobson, MS; Kinch, L; Lehel, J; Schelp, RH
Date: 1992.
Published by: JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING (Volume no.: 11, Page: 161-172)

Networks communicating for each pairing of terminals

Authors: Csaba, L; Faudree, RJ; Gyárfás, A; Lehel, J; Schelp, RH
Date: 1992.
Published by: NETWORKS (Volume no.: 22, Issue no.: 7, Page: 615-626)

Variációk a Ramsey témára

Authors: Gyárfás, A
Date: 1992.
Published by: MATEMATIKAI LAPOK (Volume no.: 1, Issue no.: 1, Page: 1-24)

Minimal path-pairable graphs

Authors: Faudree, RJ; Gyárfás, A; Lehel, J
Date: 1992.
Published by: CONGRESSUS NUMERANTIUM (Volume no.: 88, Page: 111-128)