András Gyárfás

ORCID

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 30

Top Venues

Publications

János Barát, András Gyárfás, Géza Tóth
Monochromatic spanning trees and matchings in ordered complete graphs. J. Graph Theory 105 (4) (2024)
András Gyárfás
Problems close to my heart. Eur. J. Comb. 111 (2023)
Zoltán Füredi, András Gyárfás, Zoltán Király
Problems and results on 1-cross-intersecting set pair systems. Comb. Probab. Comput. 32 (4) (2023)
András Gyárfás, Gábor N. Sárközy
-s. Graphs Comb. 39 (5) (2023)
András Gyárfás, Gábor N. Sárközy
The linear Turán number of small triple systems or why is the wicket interesting? Discret. Math. 345 (11) (2022)
Louis DeBiasio, András Gyárfás
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs. J. Graph Theory 100 (4) (2022)
Zoltán Füredi, András Gyárfás, Attila Sali
Turán number of special four cycles in triple systems. Discret. Math. 345 (1) (2022)
Alvaro Carbonero, Willem Fletcher, Jing Guo, András Gyárfás, Rona Wang, Shiyu Yan
Crowns in Linear $3$-Graphs of Minimum Degree $4$. Electron. J. Comb. 29 (4) (2022)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy
Linear Turán numbers of acyclic triple systems. Eur. J. Comb. 99 (2022)
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
Ramsey numbers of path-matchings, covering designs, and 1-cores. J. Comb. Theory, Ser. B 146 (2021)
András Gyárfás, Gábor N. Sárközy
Turán and Ramsey numbers in linear triple systems. Discret. Math. 344 (3) (2021)
András Gyárfás, Jeno Lehel
Order plus size of 𝜏-critical graphs. J. Graph Theory 96 (1) (2021)
Zoltán Füredi, András Gyárfás
An Extension of Mantel's Theorem to k-Graphs. Am. Math. Mon. 127 (3) (2020)
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales
Distribution of colors in Gallai colorings. Eur. J. Comb. 86 (2020)
András Gyárfás, Gábor N. Sárközy
Matchings with few colors in colored complete graphs and hypergraphs. Discret. Math. 343 (5) (2020)
Eben Blaisdell, András Gyárfás, Robert A. Krueger, Ronen Wdowinski
-free parts. Electron. J. Comb. 26 (3) (2019)
András Gyárfás
The Turán Number of Berge K_4 in Triple Systems. SIAM J. Discret. Math. 33 (1) (2019)
Maria Axenovich, András Gyárfás
A note on Ramsey numbers for Berge-G hypergraphs. Discret. Math. 342 (5) (2019)
András Gyárfás
Large Sets of t-designs and a Ramsey-type Problem. Integers 18 (2018)
András Gyárfás, Stephen G. Hartke, Charles Viss
-Saturated Hypergraphs. Electron. J. Comb. 25 (4) (2018)
András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett
Chromatic Ramsey number of acyclic hypergraphs. Discret. Math. 340 (3) (2017)
János Barát, András Gyárfás, Gábor N. Sárközy
Rainbow matchings in bipartite multigraphs. Period. Math. Hung. 74 (1) (2017)
András Gyárfás, Gábor N. Sárközy
Cliques in $C_4$ -free graphs of large minimum degree. Period. Math. Hung. 74 (1) (2017)
András Gyárfás, Zoltán Király
Covering complete partite hypergraphs by monochromatic components. Discret. Math. 340 (12) (2017)
András Gyárfás, Gábor N. Sárközy
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition. Electron. J. Comb. 24 (3) (2017)
András Gyárfás, Gábor N. Sárközy
Ramsey Number of a Connected Triangle Matching. J. Graph Theory 83 (2) (2016)
András Gyárfás
Vertex covers by monochromatic pieces - A survey of results and problems. Discret. Math. 339 (7) (2016)
András Gyárfás, Jeno Lehel
Red-Blue Clique Partitions and (1-1)-Transversals. Electron. J. Comb. 23 (3) (2016)
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. Discret. Math. 339 (6) (2016)
András Gyárfás, Gábor N. Sárközy
Induced Colorful Trees and Paths in Large Chromatic Graphs. Electron. J. Comb. 23 (4) (2016)
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 Comb. 31 (1) (2015)
András Gyárfás, Gábor N. Sárközy
Rainbow matchings and cycle-free partial transversals of Latin squares. Discret. Math. 327 (2014)
Louis Esperet, András Gyárfás, Frédéric Maffray
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs Comb. 30 (2) (2014)
András Gyárfás
-chromatic graphs. Discuss. Math. Graph Theory 34 (1) (2014)
András Gyárfás, Gábor N. Sárközy
Monochromatic Loose-cycle Partitions in Hypergraphs. Electron. J. Comb. 21 (2) (2014)
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. Comb. 34 (5) (2014)
Dömötör Pálvölgyi, András Gyárfás
Domination in transitive colorings of tournaments. J. Comb. Theory, Ser. B 107 (2014)
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components. Electron. J. Comb. 21 (2) (2014)
Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi
Multicolor Ramsey numbers for triple systems. Discret. Math. 322 (2014)
Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress
Disconnected Colors in Generalized Gallai-Colorings. J. Graph Theory 74 (1) (2013)
András Gyárfás, Gábor N. Sárközy
Monochromatic Path and Cycle Partitions in Hypergraphs. Electron. J. Comb. 20 (1) (2013)
Lucas Colucci, András Gyárfás
Coloring 2-Intersecting Hypergraphs. Electron. J. Comb. 20 (3) (2013)
Dömötör Pálvölgyi, András Gyárfás
Domination in transitive colorings of tournaments CoRR (2013)
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts. Electron. J. Comb. 19 (3) (2012)
András Gyárfás, Ghaffar Raeisi
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs. Electron. J. Comb. 19 (2) (2012)
András Gyárfás, András Sebö, Nicolas Trotignon
The chromatic gap and its extremes. J. Comb. Theory, Ser. B 102 (5) (2012)
András Gyárfás, Gábor Simonyi, Ágnes Tóth
Gallai colorings and domination in multipartite digraphs. J. Graph Theory 71 (3) (2012)
András Gyárfás, Gábor N. Sárközy
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp. Comb. Probab. Comput. 21 (1-2) (2012)
András Gyárfás, Dömötör Pálvölgyi
Monochromatic even cycles. Contributions Discret. Math. 7 (1) (2012)
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. J. Graph Theory 71 (1) (2012)
András Gyárfás, Jenö Lehel
Trees in greedy colorings of hypergraphs. Discret. Math. 311 (2-3) (2011)
András Gyárfás, Gábor N. Sárközy
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. Comb. Probab. Comput. 20 (1) (2011)
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. Australas. J Comb. 50 (2011)
András Gyárfás, Manouchehr Zaker
On (δ, χ)-Bounded Families of Graphs. Electron. J. Comb. 18 (1) (2011)
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. Electron. J. Comb. 18 (1) (2011)
András Gyárfás, Gábor N. Sárközy
Gallai colorings of non-complete graphs. Discret. Math. 310 (5) (2010)
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. J. Graph Theory 63 (4) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. Graphs Comb. 26 (1) (2010)
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
Ramsey-type results for Gallai colorings. J. Graph Theory 64 (3) (2010)
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
Stability of the path-path Ramsey number. Discret. Math. 309 (13) (2009)
András Gyárfás, Gábor N. Sárközy, Richard H. Schelp
Multipartite Ramsey numbers for odd cycles. J. Graph Theory 61 (1) (2009)
András Gyárfás, Penny E. Haxell
Large monochromatic components in colorings of complete 3-uniform hypergraphs. Discret. Math. 309 (10) (2009)
András Gyárfás, Gábor N. Sárközy
Size of monochromatic components in local edge colorings. Discret. Math. 308 (12) (2008)
Arie Bialostocki, Daniel Finkel, András Gyárfás
Disjoint chorded cycles in graphs. Discret. Math. 308 (23) (2008)
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. J. Graph Theory 59 (1) (2008)
András Gyárfás
Ramsey and Turán-type problems in bipartite geometric graphs. Electron. Notes Discret. Math. 31 (2008)
Béla Bollobás, András Gyárfás
Highly connected monochromatic subgraphs. Discret. Math. 308 (9) (2008)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-color Ramsey numbers for paths. Comb. 28 (4) (2008)
András Gyárfás, Gábor N. Sárközy
Size of Monochromatic Double Stars in Edge Colorings. Graphs Comb. 24 (6) (2008)
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) (2008)
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. Electron. J. Comb. 15 (1) (2008)
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55 (1) (2007)
András Gyárfás, Jenö Lehel, Richard H. Schelp
Finding a monochromatic subgraph or a rainbow path. J. Graph Theory 54 (1) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Tripartite Ramsey numbers for paths. J. Graph Theory 55 (2) (2007)
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
Three-Color Ramsey Numbers For Paths. Comb. 27 (1) (2007)
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) (2006)
Mathew Cropper, András Gyárfás, Jenö Lehel
Hall ratio of the Mycielski graphs. Discret. Math. 306 (16) (2006)
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Odd cycles and Theta-cycles in hypergraphs. Discret. Math. 306 (19-20) (2006)
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) (2006)
Zoltán Füredi, András Gyárfás, Gábor Simonyi
Connected matchings and Hadwiger's conjecture. Comb. Probab. Comput. 14 (3) (2005)
András Gyárfás, Alice Hubenko
Semistrong edge coloring of graphs. J. Graph Theory 49 (1) (2005)
András Gyárfás, Tommy Jensen, Michael Stiebitz
On graphs with strongly independent color-classes. J. Graph Theory 46 (1) (2004)
András Gyárfás, Gábor Simonyi
Edge colorings of complete graphs without tricolored triangles. J. Graph Theory 46 (3) (2004)
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
Coloring the Maximal Cliques of Graphs. SIAM J. Discret. Math. 17 (3) (2004)
Mathew Cropper, András Gyárfás, Jenö Lehel
Edge list multicoloring trees: An extension of Hall's theorem. J. Graph Theory 42 (3) (2003)
András Gyárfás, André E. Kézdy, Jenö Lehel
A finite basis characterization of ?-split colorings. Discret. Math. 257 (2-3) (2002)
András Gyárfás
Transitive Edge Coloring of Graphs and Dimension of Lattices. Comb. 22 (4) (2002)
András Gyárfás, Alice Hubenko, József Solymosi
-Free Graphs. Comb. 22 (2) (2002)
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
)-free families. Discret. Math. 257 (2-3) (2002)
András Gyárfás
Transitive tournaments and self-complementary graphs. J. Graph Theory 38 (2) (2001)
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
On the Maximum Size of (p, Q) - free Families. Electron. Notes Discret. Math. 10 (2001)
Daniel J. Kleitman, András Gyárfás, Géza Tóth
Convex Sets in the Plane with Three of Every Four Meeting. Comb. 21 (2) (2001)
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) (2001)
Noga Alon, András Gyárfás, Miklós Ruszinkó
Decreasing the diameter of bounded degree graphs. J. Graph Theory 35 (3) (2000)
Paul Erdös, András Gyárfás
Split and balanced colorings of complete graphs. Discret. Math. 200 (1-3) (1999)
András Gyárfás, Zoltán Király, Jenö Lehel
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discret. Math. 12 (3) (1999)
Ralph J. Faudree, András Gyárfás
Extremal problems for forbidden pairs that imply hamiltonicity. Discuss. Math. Graph Theory 19 (1) (1999)
András Gyárfás, Richard H. Schelp
A Communication Problem and Directed Triple Systems. Discret. Appl. Math. 85 (2) (1998)
Guantao Chen, András Gyárfás, Richard H. Schelp
Vertex colorings with a distance restriction. Discret. Math. 191 (1-3) (1998)
András Gyárfás
Generalized Split Graphs and Ramsey Numbers. J. Comb. Theory, Ser. A 81 (2) (1998)

András Gyárfás.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

András Gyárfás