Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarAndrás Gyárfás
Person information
- affiliation: Hungarian Academy of Sciences
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j127]András Gyárfás, Stephen G. Hartke, Charles Viss:
Uniquely $K_r^{(k)}$-Saturated Hypergraphs. Electr. J. Comb. 25(4): P4.35 (2018)- 2017
- [j126]András Gyárfás, Gábor N. Sárközy:
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition. Electr. J. Comb. 24(3): P3.54 (2017) - [j125]András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett:
Chromatic Ramsey number of acyclic hypergraphs. Discrete Mathematics 340(3): 373-378 (2017) - [j124]András Gyárfás, Zoltán Király:
Covering complete partite hypergraphs by monochromatic components. Discrete Mathematics 340(12): 2753-2761 (2017) - [j123]András Gyárfás, Gábor N. Sárközy:
Cliques in \(C_4\) -free graphs of large minimum degree. Periodica Mathematica Hungarica 74(1): 73-78 (2017) - [j122]János Barát, András Gyárfás, Gábor N. Sárközy:
Rainbow matchings in bipartite multigraphs. Periodica Mathematica Hungarica 74(1): 108-111 (2017) - 2016
- [j121]András Gyárfás, Jeno Lehel:
Red-Blue Clique Partitions and (1-1)-Transversals. Electr. J. Comb. 23(3): P3.40 (2016) - [j120]András Gyárfás, Gábor N. Sárközy:
Induced Colorful Trees and Paths in Large Chromatic Graphs. Electr. J. Comb. 23(4): P4.46 (2016) - [j119]János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy:
Ramsey number of paths and connected matchings in Ore-type host graphs. Discrete Mathematics 339(6): 1690-1698 (2016) - [j118]András Gyárfás:
Vertex covers by monochromatic pieces - A survey of results and problems. Discrete Mathematics 339(7): 1970-1977 (2016) - [j117]András Gyárfás, Gábor N. Sárközy:
Ramsey Number of a Connected Triangle Matching. Journal of Graph Theory 83(2): 109-119 (2016) - 2015
- [j116]András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow:
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems. Graphs and Combinatorics 31(1): 131-140 (2015) - 2014
- [j115]József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy:
Partitioning 2-edge-colored graphs by monochromatic paths and cycles. Combinatorica 34(5): 507-526 (2014) - [j114]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components. Electr. J. Comb. 21(2): P2.33 (2014) - [j113]András Gyárfás, Gábor N. Sárközy:
Monochromatic Loose-cycle Partitions in Hypergraphs. Electr. J. Comb. 21(2): P2.36 (2014) - [j112]Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi:
Multicolor Ramsey numbers for triple systems. Discrete Mathematics 322: 69-77 (2014) - [j111]András Gyárfás, Gábor N. Sárközy:
Rainbow matchings and cycle-free partial transversals of Latin squares. Discrete Mathematics 327: 96-102 (2014) - [j110]András Gyárfás:
Packing trees into n-chromatic graphs. Discussiones Mathematicae Graph Theory 34(1): 199-201 (2014) - [j109]Louis Esperet, András Gyárfás, Frédéric Maffray:
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs and Combinatorics 30(2): 365-375 (2014) - [j108]Dömötör Pálvölgyi, András Gyárfás:
Domination in transitive colorings of tournaments. J. Comb. Theory, Ser. B 107: 1-11 (2014) - 2013
- [j107]András Gyárfás, Gábor N. Sárközy:
Monochromatic Path and Cycle Partitions in Hypergraphs. Electr. J. Comb. 20(1): P18 (2013) - [j106]Lucas Colucci, András Gyárfás:
Coloring 2-Intersecting Hypergraphs. Electr. J. Comb. 20(3): P37 (2013) - [j105]Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress:
Disconnected Colors in Generalized Gallai-Colorings. Journal of Graph Theory 74(1): 104-114 (2013) - [p1]András Gyárfás:
Reflections on a Problem of Erdős and Hajnal. The Mathematics of Paul Erdős II 2013: 135-141 - [i1]Dömötör Pálvölgyi, András Gyárfás:
Domination in transitive colorings of tournaments. CoRR abs/1302.4677 (2013) - 2012
- [j104]András Gyárfás, Dömötör Pálvölgyi:
Monochromatic even cycles. Contributions to Discrete Mathematics 7(1) (2012) - [j103]András Gyárfás, Ghaffar Raeisi:
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs. Electr. J. Comb. 19(2): P30 (2012) - [j102]Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth:
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts. Electr. J. Comb. 19(3): P27 (2012) - [j101]András Gyárfás, Gábor N. Sárközy:
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp. Combinatorics, Probability & Computing 21(1-2): 179-186 (2012) - [j100]András Gyárfás, András Sebö, Nicolas Trotignon:
The chromatic gap and its extremes. J. Comb. Theory, Ser. B 102(5): 1155-1178 (2012) - [j99]Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray:
New Bounds on the Grundy Number of Products of Graphs. Journal of Graph Theory 71(1): 78-88 (2012) - [j98]András Gyárfás, Gábor Simonyi, Ágnes Tóth:
Gallai colorings and domination in multipartite digraphs. Journal of Graph Theory 71(3): 278-292 (2012) - 2011
- [j97]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp:
Long rainbow cycles in proper edge-colorings of complete graphs. Australasian J. Combinatorics 50: 45-54 (2011) - [j96]András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. Electr. J. Comb. 18(1) (2011) - [j95]András Gyárfás, Manouchehr Zaker:
On (δ, χ)-Bounded Families of Graphs. Electr. J. Comb. 18(1) (2011) - [j94]András Gyárfás, Gábor N. Sárközy:
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. Combinatorics, Probability & Computing 20(1): 53-71 (2011) - [j93]András Gyárfás, Jenö Lehel:
Trees in greedy colorings of hypergraphs. Discrete Mathematics 311(2-3): 208-209 (2011) - 2010
- [j92]András Gyárfás, Gábor N. Sárközy:
Gallai colorings of non-complete graphs. Discrete Mathematics 310(5): 977-980 (2010) - [j91]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs and Combinatorics 26(1): 71-76 (2010) - [j90]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. Journal of Graph Theory 63(4): 288-299 (2010) - [j89]András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow:
Ramsey-type results for Gallai colorings. Journal of Graph Theory 64(3): 233-243 (2010)
2000 – 2009
- 2009
- [j88]András Gyárfás, Penny E. Haxell:
Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discrete Mathematics 309(10): 3156-3160 (2009) - [j87]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Stability of the path-path Ramsey number. Discrete Mathematics 309(13): 4590-4595 (2009) - [j86]András Gyárfás, Gábor N. Sárközy, Richard H. Schelp:
Multipartite Ramsey numbers for odd cycles. Journal of Graph Theory 61(1): 12-21 (2009) - 2008
- [j85]Andrá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) - [j84]András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. Electr. J. Comb. 15(1) (2008) - [j83]Béla Bollobás, András Gyárfás:
Highly connected monochromatic subgraphs. Discrete Mathematics 308(9): 1722-1725 (2008) - [j82]Andrá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) - [j81]Arie Bialostocki, Daniel Finkel, András Gyárfás:
Disjoint chorded cycles in graphs. Discrete Mathematics 308(23): 5886-5890 (2008) - [j80]András Gyárfás:
Ramsey and Turán-type problems in bipartite geometric graphs. Electronic Notes in Discrete Mathematics 31: 253-254 (2008) - [j79]András Gyárfás, Gábor N. Sárközy:
Size of Monochromatic Double Stars in Edge Colorings. Graphs and Combinatorics 24(6): 531-536 (2008) - [j78]Andrá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) - [j77]Zoltá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
- [j76]Andrá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) - [j75]Andrá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) - [j74]Noga 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) - [j73]Andrá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
- [j72]Mathew Cropper, András Gyárfás, Jenö Lehel:
Hall ratio of the Mycielski graphs. Discrete Mathematics 306(16): 1988-1990 (2006) - [j71]Andrá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) - [j70]Andrá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) - [j69]Paul 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) - 2005
- [j68]Zoltá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) - [j67]András Gyárfás, Alice Hubenko:
Semistrong edge coloring of graphs. Journal of Graph Theory 49(1): 39-47 (2005) - 2004
- [j66]András Gyárfás, T. Jensen, Michael Stiebitz:
On graphs with strongly independent color-classes. Journal of Graph Theory 46(1): 1-14 (2004) - [j65]András Gyárfás, Gábor Simonyi:
Edge colorings of complete graphs without tricolored triangles. Journal of Graph Theory 46(3): 211-216 (2004) - [j64]Gá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) - 2003
- [j63]Mathew Cropper, András Gyárfás, Jenö Lehel:
Edge list multicoloring trees: An extension of Hall's theorem. Journal of Graph Theory 42(3): 246-255 (2003) - 2002
- [j62]András Gyárfás, Alice Hubenko, József Solymosi:
Large Cliques in C4-Free Graphs. Combinatorica 22(2): 269-274 (2002) - [j61]András Gyárfás:
Transitive Edge Coloring of Graphs and Dimension of Lattices. Combinatorica 22(4): 479-496 (2002) - [j60]Zoltá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) - [j59]Andrá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
- [j58]Daniel 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) - [j57]Zoltá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) - [j56]Aart 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) - [j55]András Gyárfás:
Transitive tournaments and self-complementary graphs. Journal of Graph Theory 38(2): 111-112 (2001) - 2000
- [j54]Noga Alon, András Gyárfás, Miklós Ruszinkó:
Decreasing the diameter of bounded degree graphs. Journal of Graph Theory 35(3): 161-172 (2000)
1990 – 1999
- 1999
- [j53]Paul Erdös, András Gyárfás:
Split and balanced colorings of complete graphs. Discrete Mathematics 200(1-3): 79-86 (1999) - [j52]Ralph J. Faudree, András Gyárfás:
Extremal problems for forbidden pairs that imply hamiltonicity. Discussiones Mathematicae Graph Theory 19(1): 13-29 (1999) - [j51]Andrá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) - [r1]Lowell W. Beineke, Stephen B. Maurer, Edward R. Scheinerman, Bennet Manvel, Arthur T. White, Paul K. Stockmeyer, Michael Doob, Stefan A. Burr, András Gyárfás:
Graph Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j50]Paul 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) - [j49]András Gyárfás, Richard H. Schelp:
A Communication Problem and Directed Triple Systems. Discrete Applied Mathematics 85(2): 139-147 (1998) - [j48]Guantao Chen, András Gyárfás, Richard H. Schelp:
Vertex colorings with a distance restriction. Discrete Mathematics 191(1-3): 65-82 (1998) - [j47]Barry 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) - [j46]András Gyárfás:
Generalized Split Graphs and Ramsey Numbers. J. Comb. Theory, Ser. A 81(2): 255-261 (1998) - 1997
- [j45]Paul Erdös, András Gyárfás:
A Variant of the Classical Ramsey Problem. Combinatorica 17(4): 459-467 (1997) - [j44]
- [j43]Andrá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) - [j42]Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa:
The size of the largest bipartite subgraphs. Discrete Mathematics 177(1-3): 267-271 (1997) - [j41]Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp:
A Class of Edge Critical 4-Chromatic Graphs. Graphs and Combinatorics 13(2): 139-146 (1997) - 1996
- [j40]Paul Erdös, András Gyárfás, Tomasz Luczak:
Graphs in which each C4 spans K4. Discrete Mathematics 154(1-3): 263-268 (1996) - [j39]András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray:
Minimal non-neighborhood-perfect graphs. Journal of Graph Theory 21(1): 55-66 (1996) - [j38]Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
An edge coloring problem for graph products. Journal of Graph Theory 23(3): 297-302 (1996) - [j37]Ralph J. Faudree, András Gyárfás:
Endpoint extendable paths in tournaments. Journal of Graph Theory 23(3): 303-307 (1996) - 1995
- [j36]Andrá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
- [j35]Paul Erdös, András Gyárfás, Tomasz Luczak:
Independet Transversals in Sparse Partite Hypergraphs. Combinatorics, Probability & Computing 3: 293-296 (1994) - [j34]Ralph 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) - 1993
- [j33]Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp:
Rainbow coloring the cube. Journal of Graph Theory 17(5): 607-612 (1993) - 1992
- [j32]
- [j31]Ralph J. Faudree, András Gyárfás, Jenö Lehel:
Three-regular path pairable graphs. Graphs and Combinatorics 8(1): 45-52 (1992) - [j30]Jeffrey H. Dinitz, David K. Garnick, András Gyárfás:
On the irregularity strength of the m × n grid. Journal of Graph Theory 16(4): 355-374 (1992) - [j29]László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp:
Networks communicating for each pairing of terminals. Networks 22(7): 615-626 (1992) - 1991
- [j28]András Gyárfás, Jenö Lehel:
Effective on-line coloring of P5-free graphs. Combinatorica 11(2): 181-184 (1991) - [j27]Zoltán Füredi, András Gyárfás:
Covering t-element Sets by Partitions. Eur. J. Comb. 12(6): 483-489 (1991) - [j26]Paul 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
- [j25]Fan 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) - [j24]András Gyárfás:
A simple lower bound on edge coverings by cliques. Discrete Mathematics 85(1): 103-104 (1990)
1980 – 1989
- 1989
- [j23]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) - [j22]Ralph 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) - [j21]Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp:
Domination in colored complete graphs. Journal of Graph Theory 13(6): 713-718 (1989) - 1988
- [j20]András Gyárfás, Michael S. Jacobson, Lael F. Kinch:
On a generalization of transitivity for digraphs. Discrete Mathematics 69(1): 35-41 (1988) - [j19]András Gyárfás, Jenö Lehel, Zsolt Tuza:
Clumsy packing of dominoes. Discrete Mathematics 71(1): 33-46 (1988) - [j18]András Gyárfás:
The irregularity strength of Km, m is 4 for odd m. Discrete Mathematics 71(3): 273-274 (1988) - [j17]András Gyárfás, Jenö Lehel:
On-line and first fit colorings of graphs. Journal of Graph Theory 12(2): 217-227 (1988) - 1987
- [j16]András Gyárfás, Zsolt Tuza:
An upper bound on the Ramsey number of trees. Discrete Mathematics 66(3): 309-310 (1987) - [j15]András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza:
Ramsey numbers for local colorings. Graphs and Combinatorics 3(1): 267-277 (1987) - [j14]Andrá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
- [j13]
- 1985
- [j12]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) - [j11]András Gyárfás, Jenö Lehel, Zsolt Tuza:
How many atoms can be defined by boxes. Combinatorica 5(3): 193-204 (1985) - [j10]András Gyárfás:
On the chromatic number of multiple interval graphs and overlap graphs. Discrete Mathematics 55(2): 161-166 (1985) - [j9]András Gyárfás, Jenö Lehel:
Covering and coloring problems for relatives of intervals. Discrete Mathematics 55(2): 167-180 (1985) - 1984
- [j8]Andrá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) - [j7]András Gyárfás, Cecil C. Rousseau, Richard H. Schelp:
An extremal problem for paths in bipartite graphs. Journal of Graph Theory 8(1): 83-95 (1984) - [j6]András Gyárfás, János Komlós, Endre Szemerédi:
On the distribution of cycle lengths in graphs. Journal of Graph Theory 8(4): 441-462 (1984) - 1983
- [j5]András Gyárfás, Jenö Lehel:
Hypergraph families with bounded edge cover or transversal number. Combinatorica 3(3): 351-358 (1983) - [j4]András Gyárfás:
Vertex coverings by monochromatic paths and cycles. Journal of Graph Theory 7(1): 131-135 (1983) - 1980
- [j3]András Gyárfás:
Still another triangle-free infinite-chromatic graph. Discrete Mathematics 30(2): 185 (1980) - [j2]