Items where Author is "Gyárfás, András"
 | Up a level |
Number of items: 88.
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2011 | Gyárfás, András and Sárközy, Gábor The 3-colour Ramsey number of a 3-uniform Berge cycle | ISI Article | |
| 2011 | Gyárfás, András Large monochromatic components in edge colorings of graphs: a survey | Conference or Workshop Item | |
| 2011 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Schelp, R Long rainbow cycles in proper edge-colorings of complete graphs | Article | |
| 2011 | Gyárfás, András and Zaker, M On (δ, Χ)-bounded families of graphs | ISI Article | |
| 2011 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Partitioning 3-colored complete graphs into three monochromatic cycles | ISI Article | |
| 2011 | Gyárfás, András Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs | Article | |
| 2011 | Gyárfás, András and Lehel, J Trees in greedy colorings of hypergraphs | ISI Article | |
| 2010 | Gyárfás, András and Sárközy, Gábor Gallai colorings of non-complete graphs | ISI Article | |
| 2010 | Gyárfás, András Large monochromatic components in edge coloring of graphs: A survey | Book Section | |
| 2010 | Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre Long monochromatic Berge cycles in colored 4-uniform hypergraphs | ISI Article | |
| 2010 | Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs | ISI Article | |
| 2010 | Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre Monochromatic matchings in the shadow graph of almost complete hypergraphs | ISI Article | |
| 2010 | Gyárfás, András and Mhalla, Mehdi Rainbow and orthogonal paths in factorizations of K_n | ISI Article | |
| 2010 | Gyárfás, András and Sárközy, Gábor and Sebő, András and Selkow, S. Ramsey-type results for Gallai colorings | ISI Article | |
| 2009 | Gyárfás, András and Haxell, Penny Large monochromatic components in colorings of complete 3-uniform hypergraphs | ISI Article | |
| 2009 | Gyárfás, András and Sárközy, Gábor and Schelp, Richard Multipartite Ramsey numbers for odd cycles | ISI Article | |
| 2009 | Gyárfás, András and Sárközy, Gábor and Szemerédi, Endre Stability of the path-path Ramsey number | ISI Article | |
| 2008 | Bialostocki, Arie and Finkel, Daniel and Gyárfás, András Disjoint chorded cycles in graphs | ISI Article | |
| 2008 | Bollobás, Béla and Gyárfás, András Highly connected monochromatic subgraphs | ISI Article | |
| 2008 | Füredi, Zoltán and Gyárfás, András and Sárközy, Gábor and Selkow, Stanley Inequalities for the first-fit chromatic number | ISI Article | |
| 2008 | Gyárfás, András and Lehel, Jenő and Sárközy, Gábor and Schelp, Richard Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs | ISI Article | |
| 2008 | Gyárfás, András Ramsey and Turán-type problems in bipartite geometric graphs | Article | |
| 2008 | Gyárfás, András and Sárközy, Gábor and Szemeredi, Endre The Ramsey number of diamond matchings and loose cycles in hypergraphs | ISI Article | |
| 2008 | Gyárfás, András and Sárközy, Gábor Size of Monochromatic double stars in edge colorings | Article | |
| 2008 | Gyárfás, András and Sárközy, Gábor Size of monochromatic components in local edge colorings | ISI Article | |
| 2008 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Three-color Ramsey numbers for paths | ISI Article | |
| 2007 | Gyárfás, András and Lehel, Jenő and Schelp, Richard H. Finding a monochromatic subgraph or a rainbow path | ISI Article | |
| 2007 | Bollobas, Bela and Gyárfás, András Maximum directed cuts in acyclic digraphs | Article | |
| 2007 | Alon, Noga and Bollobás, Béla and Gyárfás, András and Lehel, Jenő and Scott, Alex Maximum directed cuts in acyclic digraphs | ISI Article | |
| 2007 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Three-color Ramsey numbers for paths | ISI Article | |
| 2007 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre Tripartite Ramsey numbers for paths | ISI Article | |
| 2006 | Cropper, M. and Gyárfás, András and Lehel, Jenő Hall ratio of the Mycielski graphs | ISI Article | |
| 2006 | Balister, P. and Gyárfás, András and Lehel, Jenő and Schelp, R. Mono-multi bipartite Ramsey numbers, designs, and matrices | ISI Article | |
| 2006 | Gyárfás, András and Jacobson, M. and Kezdy, A. and Lehel, Jenő Odd cycles and Theta-cycles in hypergraphs | ISI Article | |
| 2006 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E. One-sided coverings of colored complete bipartite graphs | Book Section | |
| 2006 | Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemeredi, E. An improved bound for the monochromatic cycle partition number |  | ISI Article |
| 2005 | Füredi, Z. and Gyárfás, András and Simonyi, G. Connected matchings and Hadwigerâ��s conjecture | Article | |
| 2005 | Gyárfás, András and Hubenko, A. Semistrong edge coloring of graphs | Article | |
| 2004 | Bacsó, Gábor and Gravier, S. and Gyárfás, András and Preissmann, M. and Sebő, A. Coloring the maximal cliques of graphs | Article | |
| 2004 | Gyárfás, András and Simonyi, G. Edge colorings of complete graphs without tricolored triangles | Article | |
| 2004 | Gyárfás, András and Jensen, T. and Stiebitz, M. On graphs with strongly independent color-classes | Article | |
| 2003 | Cropper, M. and Gyárfás, András and Lehel, Jenő Edge list multicoloring trees: an extension of Hall's theorem | Article | |
| 2002 | Gyárfás, András Erdos problems on irregularities of line sizes and point degrees. Vol II | Book Section | |
| 2002 | Gyárfás, András and Hubenkó, A. and Solymosi, J. Large cliques in C4-free graphs | Article | |
| 2002 | Füredi, Z. and Gyárfás, András and Ruszinkó, Miklós On the maximum size of (p,Q)-free families | Article | |
| 2002 | Gyárfás, András and Hraskó, A. Teljes gráfok felbontásairól. (Decompositions of complete graphs.) (in Hungarian) | Book Section | |
| 2002 | Gyárfás, András and Kézdy, AE and Lehel, Jenő A finite basis characterization of a-split colorings | Article | |
| 2001 | Blokhuis, A. and Faudree, R. and Gyárfás, András and Ruszinkó, Miklós Anti-Ramsey colorings in several rounds | Article | |
| 2001 | Kleitman, DJ and Gyárfás, András and Tóth, Gábor András Convex sets in the plane with three of every four meeting | Article | |
| 2001 | Gyárfás, András Transitive tournaments and self-complementary graphs | Article | |
| 2000 | Alon, N. and Gyárfás, András and Ruszinkó, Miklós Decreasing the diameter of bounded degree graphs | Article | |
| 2000 | Cropper, M. and Jacobson, MS and Gyárfás, András and Lehel, Jenő The Hall ratio of graphs and hypergraphs. (Les cahiers du Laboratoire Leibniz., No. 17.) | Book | |
| 2000 | Gyárfás, András Hypergraphs | Book Section | |
| 1999 | Gyárfás, András and Király, Z. and Lehel, L. On-line 3-chromatic graphs I. Triangle free graphs | Article | |
| 1999 | Faudree, RJ and Gyárfás, András and Lehel, M. Path pairable graphs | Article | |
| 1999 | Erdős, P. and Gyárfás, András Split and balanced colorings of complete graphs | Article | |
| 1998 | Guiduli, B. and Gyárfás, András and Thomassé, S. and Weidl, P. 2-partition-transitive tournaments | Article | |
| 1998 | Gyárfás, András Generalized split graphs and Ramsey numbers | Article | |
| 1998 | Erdős, P. and Gyárfás, András and Ruszinkó, Miklós How to decrease the diameter of triangle-free graphs | Article | |
| 1998 | Gyárfás, András Nonsymmetric party problems | Article | |
| 1998 | Chen, G. and Gyárfás, András and Schelp, RH Verte colorings with a distance restriction | Article | |
| 1998 | Gyárfás, András and Schelp, RH A communication problem and directed triple systems | Article | |
| 1997 | Gyárfás, András Fruit salad | Article | |
| 1997 | Gyárfás, András and Jagota, A. and Schelp, RH Monochromatic path covers in nearly complete graphs | Article | |
| 1997 | Gyárfás, András and Király, Z. and Lehel, Jenő On-line 3-chromatic graphs - II. Critical graphs | Article | |
| 1997 | Gyárfás, András Reflections on a problem of Erdős and Hajnal | Book Section | |
| 1997 | Chen, G. and Erdős, PL and Gyárfás, András and Schelp, RH A class of edge critical 4-chromatic graphs | Article | |
| 1997 | Erdos, P. and Kohayakawa, Y. and Gyárfás, András The size of the largest bipartite subgraph | Article | |
| 1997 | Erdős, P. and Gyárfás, András A variant of the classical Ramsey problem | Article | |
| 1996 | Fudree, RJ and Gyárfás, András Endpoint extendable paths in tournaments | Article | |
| 1996 | Erdős, P. and Gyárfás, András and Luczak, T. Graphs in which each C4 spans K4 | Article | |
| 1996 | Gyárfás, András and Kratsch, D. and Lehel, Jenő and Maffray, F. Minimal non-neighbourhood perfect graphs | Article | |
| 1996 | Faudree, RJ and Gyárfás, András Path matchings in graphs | Article | |
| 1996 | Faudree, RJ and Gyárfás, András and Schelp, RH An edge coloring problem for graph products | Article | |
| 1995 | Gyárfás, András and Lehel, Jenő Linear sets with five distinct differences among any four elements | Article | |
| 1995 | Erdős, P. and Gyárfás, András Vertex covering with monochromatic paths | Article | |
| 1994 | Erdős, P. and Gyárfás, András and Luczak, T. Independent transversals in sparse partite hypergraphs | Article | |
| 1994 | Gyárfás, András On a Ramsey type problem of Shelah | Conference or Workshop Item | |
| 1994 | Faudree, RJ and Schelp, RH and Lesniak, L. and Gyárfás, András and Lehel, Jenő On the rotation distance of graphs | Article | |
| 1993 | Gyárfás, András and Király, Z. and Lehel, Jenő On-line graph coloring and finite basis problems | Conference or Workshop Item | |
| 1993 | Faudree, RJ and Gyárfás, András and Lesniak, L. and Schelp, RH Rainbow coloring the cube | Article | |
| 1992 | Gyárfás, András Graphs with k odd cycle lengths | Article | |
| 1992 | Gyárfás, András and Jacobson, MS and Kinch, L. and Lehel, Jenő and Schelp, RH Irregularity strength of uniform hypergraphs | Article | |
| 1992 | Faudree, RJ and Gyárfás, András and Lehel, Jenő Minimal path-pairable graphs | Article | |
| 1992 | Csaba, L. and Faudree, RJ and Gyárfás, András and Lehel, Jenő and Schelp, RH Networks communicating for each pairing of terminals | Article | |
| 1992 | Dinitz, JH and Garnick, DK and Gyárfás, András On the irregularity strength of the m x n grid | Article | |
| 1992 | Faudree, RJ and Gyárfás, András and Lehel, Jenő Three-regular path pairable graphs | Article | |
| 1992 | Gyárfás, András Variációk a Ramsey témára | Article |
