dblp.uni-trier.dewww.uni-trier.de

András Gyárfás

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
61EEAndrás Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-color Ramsey numbers for paths. Combinatorica 28(4): 499-502 (2008)
60EEAndrás Gyárfás, Gábor N. Sárközy: Size of monochromatic components in local edge colorings. Discrete Mathematics 308(12): 2620-2622 (2008)
59EEArie Bialostocki, Daniel Finkel, András Gyárfás: Disjoint chorded cycles in graphs. Discrete Mathematics 308(23): 5886-5890 (2008)
58EEBéla Bollobás, András Gyárfás: Highly connected monochromatic subgraphs. Discrete Mathematics 308(9): 1722-1725 (2008)
57EEAndrás Gyárfás: Ramsey and Turán-type problems in bipartite geometric graphs. Electronic Notes in Discrete Mathematics 31: 253-254 (2008)
56EEAndrás Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory, Ser. B 98(2): 342-358 (2008)
55EEZoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow: Inequalities for the first-fit chromatic number. Journal of Graph Theory 59(1): 75-88 (2008)
2007
54EEAndrás Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Three-Color Ramsey Numbers For Paths. Combinatorica 27(1): 35-69 (2007)
53EEAndrás Gyárfás, Jenö Lehel, Richard H. Schelp: Finding a monochromatic subgraph or a rainbow path. Journal of Graph Theory 54(1): 1-12 (2007)
52EENoga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott: Maximum directed cuts in acyclic digraphs. Journal of Graph Theory 55(1): 1-13 (2007)
51EEAndrás Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: Tripartite Ramsey numbers for paths. Journal of Graph Theory 55(2): 164-174 (2007)
2006
50EEMathew Cropper, András Gyárfás, Jenö Lehel: Hall ratio of the Mycielski graphs. Discrete Mathematics 306(16): 1988-1990 (2006)
49EEAndrás Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Odd cycles and Theta-cycles in hypergraphs. Discrete Mathematics 306(19-20): 2481-2491 (2006)
48EEPaul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp: Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113(1): 101-112 (2006)
47EEAndrás Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi: An improved bound for the monochromatic cycle partition number. J. Comb. Theory, Ser. B 96(6): 855-873 (2006)
2005
46EEZoltán Füredi, András Gyárfás, Gábor Simonyi: Connected matchings and Hadwiger's conjecture. Combinatorics, Probability & Computing 14(3): 435-438 (2005)
45EEAndrás Gyárfás, Alice Hubenko: Semistrong edge coloring of graphs. Journal of Graph Theory 49(1): 39-47 (2005)
2004
44EEAndrás Gyárfás, T. Jensen, Michael Stiebitz: On graphs with strongly independent color-classes. Journal of Graph Theory 46(1): 1-14 (2004)
43EEAndrás Gyárfás, Gábor Simonyi: Edge colorings of complete graphs without tricolored triangles. Journal of Graph Theory 46(3): 211-216 (2004)
42EEGábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö: Coloring the Maximal Cliques of Graphs. SIAM J. Discrete Math. 17(3): 361-376 (2004)
2002
41EEAndrás Gyárfás, Alice Hubenko, József Solymosi: Large Cliques in C4-Free Graphs. Combinatorica 22(2): 269-274 (2002)
40EEAndrás Gyárfás: Transitive Edge Coloring of Graphs and Dimension of Lattices. Combinatorica 22(4): 479-496 (2002)
39EEZoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the maximum size of (p, Q)-free families. Discrete Mathematics 257(2-3): 385-403 (2002)
38EEAndrás Gyárfás, André E. Kézdy, Jenö Lehel: A finite basis characterization of ?-split colorings. Discrete Mathematics 257(2-3): 415-421 (2002)
2001
37EEDaniel J. Kleitman, András Gyárfás, Géza Tóth: Convex Sets in the Plane with Three of Every Four Meeting. Combinatorica 21(2): 221-232 (2001)
36EEZoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the Maximum Size of (p, Q) - free Families. Electronic Notes in Discrete Mathematics 10: 247-249 (2001)
35EEAart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó: Anti-Ramsey Colorings in Several Rounds. J. Comb. Theory, Ser. B 82(1): 1-18 (2001)
1999
34EEPaul Erdös, András Gyárfás: Split and balanced colorings of complete graphs. Discrete Mathematics 200(1-3): 79-86 (1999)
33EEAndrás Gyárfás, Zoltán Király, Jenö Lehel: On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discrete Math. 12(3): 385-411 (1999)
1998
32EEPaul Erdös, András Gyárfás, Miklós Ruszinkó: How to decrease the diameter of triangle-free graphs. Combinatorica 18(4): 493-501 (1998)
31EEAndrás Gyárfás, Richard H. Schelp: A Communication Problem and Directed Triple Systems. Discrete Applied Mathematics 85(2): 139-147 (1998)
30EEGuantao Chen, András Gyárfás, Richard H. Schelp: Vertex colorings with a distance restriction. Discrete Mathematics 191(1-3): 65-82 (1998)
29EEAndrás Gyárfás: Generalized Split Graphs and Ramsey Numbers. J. Comb. Theory, Ser. A 81(2): 255-261 (1998)
28EEBarry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl: 2-Partition-Transitive Tournaments. J. Comb. Theory, Ser. B 72(2): 181-196 (1998)
1997
27 Paul Erdös, András Gyárfás: A Variant of the Classical Ramsey Problem. Combinatorica 17(4): 459-467 (1997)
26EEPaul Erdös, András Gyárfás, Yoshiharu Kohayakawa: The size of the largest bipartite subgraphs. Discrete Mathematics 177(1-3): 267-271 (1997)
25EEAndrás Gyárfás, Zoltán Király, Jenö Lehel: On-line 3-chromatic graphs - II critical graphs. Discrete Mathematics 177(1-3): 99-122 (1997)
24EEAndrás Gyárfás: Fruit Salad. Electr. J. Comb. 4(1): (1997)
1996
23EEPaul Erdös, András Gyárfás, Tomasz Luczak: Graphs in which each C4 spans K4. Discrete Mathematics 154(1-3): 263-268 (1996)
1995
22EEAndrás Gyárfás, Jenö Lehel: Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory, Ser. B 64(1): 108-118 (1995)
1994
21 Paul Erdös, András Gyárfás, Tomasz Luczak: Independet Transversals in Sparse Partite Hypergraphs. Combinatorics, Probability & Computing 3: 293-296 (1994)
20EERalph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel: On the rotation distance of graphs. Discrete Mathematics 126(1-3): 121-135 (1994)
1992
19EEAndrás Gyárfás: Graphs with k odd cycle lengths. Discrete Mathematics 103(1): 41-48 (1992)
1991
18 András Gyárfás, Jenö Lehel: Effective on-line coloring of P5-free graphs. Combinatorica 11(2): 181-184 (1991)
17EEPaul Erdös, András Gyárfás, László Pyber: Vertex coverings by monochromatic cycles and trees. J. Comb. Theory, Ser. B 51(1): 90-95 (1991)
1990
16EEFan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter: The maximum number of edges in 2K2-free graphs of bounded degree. Discrete Mathematics 81(2): 129-135 (1990)
15EEAndrás Gyárfás: A simple lower bound on edge coverings by cliques. Discrete Mathematics 85(1): 103-104 (1990)
1989
14 Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein: The size of chordal, interval and threshold subgraphs. Combinatorica 9(3): 245-253 (1989)
13EERalph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza: Induced matchings in bipartite graphs. Discrete Mathematics 78(1-2): 83-87 (1989)
1988
12EEAndrás Gyárfás, Michael S. Jacobson, Lael F. Kinch: On a generalization of transitivity for digraphs. Discrete Mathematics 69(1): 35-41 (1988)
11EEAndrás Gyárfás, Jenö Lehel, Zsolt Tuza: Clumsy packing of dominoes. Discrete Mathematics 71(1): 33-46 (1988)
10EEAndrás Gyárfás: The irregularity strength of Km, m is 4 for odd m. Discrete Mathematics 71(3): 273-274 (1988)
1987
9EEAndrás Gyárfás, Zsolt Tuza: An upper bound on the Ramsey number of trees. Discrete Mathematics 66(3): 309-310 (1987)
8EEAndrás Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987)
1986
7EEAndrás Gyárfás: Corrigendum. Discrete Mathematics 62(3): 333 (1986)
1985
6 András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt: On the sum of the reciprocals of cycle lengths in sparse graphs. Combinatorica 5(1): 41-52 (1985)
5 András Gyárfás, Jenö Lehel, Zsolt Tuza: How many atoms can be defined by boxes. Combinatorica 5(3): 193-204 (1985)
4EEAndrás Gyárfás: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Mathematics 55(2): 161-166 (1985)
3EEAndrás Gyárfás, Jenö Lehel: Covering and coloring problems for relatives of intervals. Discrete Mathematics 55(2): 167-180 (1985)
1984
2EEAndrás Gyárfás, Jenö Lehel, Zsolt Tuza: The structure of rectangle families dividing the plane into maximum number of atoms. Discrete Mathematics 52(2-3): 177-198 (1984)
1983
1 András Gyárfás, Jenö Lehel: Hypergraph families with bounded edge cover or transversal number. Combinatorica 3(3): 351-358 (1983)

Coauthor Index

1Noga Alon [52]
2Gábor Bacsó [42]
3Paul N. Balister (Paul Balister) [48]
4Arie Bialostocki [59]
5Aart Blokhuis [35]
6Béla Bollobás [52] [58]
7Guantao Chen [30]
8Fan R. K. Chung (Fan Chung Graham) [16]
9Mathew Cropper [50]
10Paul Erdös [14] [17] [21] [23] [26] [27] [32] [34]
11Ralph J. Faudree [13] [20] [35]
12Daniel Finkel [59]
13Zoltán Füredi [36] [39] [46] [55]
14Sylvain Gravier [42]
15Barry Guiduli [28]
16Alice Hubenko [41] [45]
17Michael S. Jacobson [12] [49]
18T. Jensen [44]
19André E. Kézdy [38] [49]
20Lael F. Kinch [12]
21Zoltán Király [25] [33]
22Daniel J. Kleitman [37]
23Yoshiharu Kohayakawa [26]
24Jenö Lehel (Jeno Lehel) [1] [2] [3] [5] [8] [11] [18] [20] [22] [25] [33] [38] [48] [49] [50] [52] [53] [56]
25Linda M. Lesniak [20]
26Tomasz Luczak [21] [23]
27Jaroslav Nesetril (Jarik Nesetril) [8]
28Edward T. Ordman [14]
29Myriam Preissmann [42]
30Hans Jürgen Prömel [6]
31László Pyber [17]
32Vojtech Rödl [8]
33Miklós Ruszinkó [32] [35] [36] [39] [47] [51] [54] [61]
34Gábor N. Sárközy [47] [51] [54] [55] [56] [60] [61]
35Richard H. Schelp [8] [13] [20] [30] [31] [48] [53] [56]
36Alex D. Scott (Alexander D. Scott) [52]
37András Sebö [42]
38Stanley M. Selkow [55]
39Gábor Simonyi [43] [46]
40József Solymosi [41]
41Michael Stiebitz [44]
42Endre Szemerédi [6] [47] [51] [54] [61]
43Stéphan Thomassé [28]
44Géza Tóth [37]
45William T. Trotter [16]
46Zsolt Tuza [2] [5] [8] [9] [11] [13] [16]
47Bernd Voigt [6]
48Peter Weidl [28]
49Yechezkel Zalcstein [14]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)