András Gyárfás

153 papers Journal 151
YearRankTypeTitle / Venue / Authors
2026 J jnl
2-Reachable Subsets in Two-Colored Graphs.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy
2026 J jnl
Perfect proper edge colorings of regular bipartite graphs with rainbow C4-s.
Discret. Math.
András Gyárfás, Gábor N. Sárközy, Adam Zsolt Wagner
2025 J jnl
Clique Covers of Complete Graphs and Piercing Multitrack Intervals.
Electron. J. Comb.
János Barát, András Gyárfás, Gábor N. Sárközy
2024 J jnl
Monochromatic spanning trees and matchings in ordered complete graphs.
J. Graph Theory
János Barát, András Gyárfás, Géza Tóth
2024 J jnl
Proper edge colorings of planar graphs with rainbow C4 ${C}_{4}$-s.
J. Graph Theory
András Gyárfás, Ryan R. Martin, Miklós Ruszinkó, Gábor N. Sárközy
2023 J jnl
Problems and results on 1-cross-intersecting set pair systems.
Comb. Probab. Comput.
Zoltán Füredi, András Gyárfás, Zoltán Király
2023 J jnl
Problems close to my heart.
Eur. J. Comb.
András Gyárfás
2023 J jnl
Proper Edge Colorings of Cartesian Products with Rainbow C
Graphs Comb.
András Gyárfás, Gábor N. Sárközy
2022 J jnl
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs.
J. Graph Theory
Louis DeBiasio, András Gyárfás
2022 J jnl
Crowns in Linear $3$-Graphs of Minimum Degree $4$.
Electron. J. Comb.
Alvaro Carbonero, Willem Fletcher, Jing Guo, András Gyárfás, Rona Wang, Shiyu Yan
2022 J jnl
Linear Turán numbers of acyclic triple systems.
Eur. J. Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy
2022 J jnl
The linear Turán number of small triple systems or why is the wicket interesting?
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2022 J jnl
Turán number of special four cycles in triple systems.
Discret. Math.
Zoltán Füredi, András Gyárfás, Attila Sali
2021 J jnl
Order plus size of 𝜏-critical graphs.
J. Graph Theory
András Gyárfás, Jeno Lehel
2021 J jnl
Ramsey numbers of path-matchings, covering designs, and 1-cores.
J. Comb. Theory B
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
2021 J jnl
Turán and Ramsey numbers in linear triple systems.
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2020 J jnl
An Extension of Mantel's Theorem to k-Graphs.
Am. Math. Mon.
Zoltán Füredi, András Gyárfás
2020 J jnl
Distribution of colors in Gallai colorings.
Eur. J. Comb.
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales
2020 J jnl
Matchings with few colors in colored complete graphs and hypergraphs.
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2019 J jnl
A note on Ramsey numbers for Berge-G hypergraphs.
Discret. Math.
Maria Axenovich, András Gyárfás
2019 J jnl
Partitioning the Power Set of [n] into C
Electron. J. Comb.
Eben Blaisdell, András Gyárfás, Robert A. Krueger, Ronen Wdowinski
2019 J jnl
The Turán Number of Berge K_4 in Triple Systems.
SIAM J. Discret. Math.
András Gyárfás
2018 J jnl
Large Sets of t-designs and a Ramsey-type Problem.
Integers
András Gyárfás
2018 J jnl
Uniquely K
Electron. J. Comb.
András Gyárfás, Stephen G. Hartke, Charles Viss
2017 J jnl
Chromatic Ramsey number of acyclic hypergraphs.
Discret. Math.
András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett
2017 J jnl
Cliques in \(C_4\) -free graphs of large minimum degree.
Period. Math. Hung.
András Gyárfás, Gábor N. Sárközy
2017 J jnl
Covering complete partite hypergraphs by monochromatic components.
Discret. Math.
András Gyárfás, Zoltán Király
2017 J jnl
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy
2017 J jnl
Rainbow matchings in bipartite multigraphs.
Period. Math. Hung.
János Barát, András Gyárfás, Gábor N. Sárközy
2016 J jnl
Induced Colorful Trees and Paths in Large Chromatic Graphs.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy
2016 J jnl
Ramsey Number of a Connected Triangle Matching.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy
2016 J jnl
Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math.
János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy
2016 J jnl
Red-Blue Clique Partitions and (1-1)-Transversals.
Electron. J. Comb.
András Gyárfás, Jeno Lehel
2016 J jnl
Vertex covers by monochromatic pieces - A survey of results and problems.
Discret. Math.
András Gyárfás
2015 J jnl
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
2014 J jnl
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electron. J. Comb.
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
2014 J jnl
Domination in transitive colorings of tournaments.
J. Comb. Theory B
Dömötör Pálvölgyi, András Gyárfás
2014 J jnl
List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs Comb.
Louis Esperet, András Gyárfás, Frédéric Maffray
2014 J jnl
Monochromatic Loose-cycle Partitions in Hypergraphs.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy
2014 J jnl
Multicolor Ramsey numbers for triple systems.
Discret. Math.
Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi
2014 J jnl
Packing trees into
Discuss. Math. Graph Theory
András Gyárfás
2014 J jnl
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb.
József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy
2014 J jnl
Rainbow matchings and cycle-free partial transversals of Latin squares.
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2013 J jnl
Coloring 2-Intersecting Hypergraphs.
Electron. J. Comb.
Lucas Colucci, András Gyárfás
2013 J jnl
Disconnected Colors in Generalized Gallai-Colorings.
J. Graph Theory
Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress
2013 J jnl
Domination in transitive colorings of tournaments
CoRR
Dömötör Pálvölgyi, András Gyárfás
2013 J jnl
Monochromatic Path and Cycle Partitions in Hypergraphs.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy
2013 — ch.
Reflections on a Problem of Erdős and Hajnal.
The Mathematics of Paul Erdős II
András Gyárfás
2012 J jnl
Gallai colorings and domination in multipartite digraphs.
J. Graph Theory
András Gyárfás, Gábor Simonyi, Ágnes Tóth
2012 J jnl
Monochromatic even cycles.
Contributions Discret. Math.
András Gyárfás, Dömötör Pálvölgyi
2012 J jnl
New Bounds on the Grundy Number of Products of Graphs.
J. Graph Theory
Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray
2012 J jnl
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electron. J. Comb.
Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth
2012 J jnl
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp.
Comb. Probab. Comput.
András Gyárfás, Gábor N. Sárközy
2012 J jnl
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs.
Electron. J. Comb.
András Gyárfás, Ghaffar Raeisi
2012 J jnl
The chromatic gap and its extremes.
J. Comb. Theory B
András Gyárfás, András Sebö, Nicolas Trotignon
2011 J jnl
Long rainbow cycles in proper edge-colorings of complete graphs.
Australas. J Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp
2011 J jnl
On (δ, χ)-Bounded Families of Graphs.
Electron. J. Comb.
András Gyárfás, Manouchehr Zaker
2011 J jnl
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electron. J. Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2011 J jnl
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.
Comb. Probab. Comput.
András Gyárfás, Gábor N. Sárközy
2011 J jnl
Trees in greedy colorings of hypergraphs.
Discret. Math.
András Gyárfás, Jenö Lehel
2010 J jnl
Gallai colorings of non-complete graphs.
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2010 J jnl
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2010 J jnl
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2010 J jnl
Ramsey-type results for Gallai colorings.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
2009 J jnl
Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discret. Math.
András Gyárfás, Penny E. Haxell
2009 J jnl
Multipartite Ramsey numbers for odd cycles.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy, Richard H. Schelp
2009 J jnl
Stability of the path-path Ramsey number.
Discret. Math.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2008 J jnl
Disjoint chorded cycles in graphs.
Discret. Math.
Arie Bialostocki, Daniel Finkel, András Gyárfás
2008 J jnl
Highly connected monochromatic subgraphs.
Discret. Math.
Béla Bollobás, András Gyárfás
2008 J jnl
Inequalities for the first-fit chromatic number.
J. Graph Theory
Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
2008 J jnl
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory B
András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp
2008 J jnl
Ramsey and Turán-type problems in bipartite geometric graphs.
Electron. Notes Discret. Math.
András Gyárfás
2008 J jnl
Size of Monochromatic Double Stars in Edge Colorings.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy
2008 J jnl
Size of monochromatic components in local edge colorings.
Discret. Math.
András Gyárfás, Gábor N. Sárközy
2008 J jnl
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electron. J. Comb.
András Gyárfás, Gábor N. Sárközy, Endre Szemerédi
2008 J jnl
Three-color Ramsey numbers for paths.
Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2007 J jnl
Finding a monochromatic subgraph or a rainbow path.
J. Graph Theory
András Gyárfás, Jenö Lehel, Richard H. Schelp
2007 J jnl
Maximum directed cuts in acyclic digraphs.
J. Graph Theory
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
2007 J jnl
Three-Color Ramsey Numbers For Paths.
Comb.
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2007 J jnl
Tripartite Ramsey numbers for paths.
J. Graph Theory
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2006 J jnl
An improved bound for the monochromatic cycle partition number.
J. Comb. Theory B
András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi
2006 J jnl
Hall ratio of the Mycielski graphs.
Discret. Math.
Mathew Cropper, András Gyárfás, Jenö Lehel
2006 J jnl
Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory A
Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
2006 J jnl
Odd cycles and Theta-cycles in hypergraphs.
Discret. Math.
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
2005 J jnl
Connected matchings and Hadwiger's conjecture.
Comb. Probab. Comput.
Zoltán Füredi, András Gyárfás, Gábor Simonyi
2005 J jnl
Semistrong edge coloring of graphs.
J. Graph Theory
András Gyárfás, Alice Hubenko
2004 J jnl
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math.
Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö
2004 J jnl
Edge colorings of complete graphs without tricolored triangles.
J. Graph Theory
András Gyárfás, Gábor Simonyi
2004 J jnl
On graphs with strongly independent color-classes.
J. Graph Theory
András Gyárfás, Tommy Jensen, Michael Stiebitz
2003 J jnl
Edge list multicoloring trees: An extension of Hall's theorem.
J. Graph Theory
Mathew Cropper, András Gyárfás, Jenö Lehel
2002 J jnl
A finite basis characterization of ?-split colorings.
Discret. Math.
András Gyárfás, André E. Kézdy, Jenö Lehel
2002 J jnl
Large Cliques in
Comb.
András Gyárfás, Alice Hubenko, József Solymosi
2002 J jnl
On the maximum size of (
Discret. Math.
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
2002 J jnl
Transitive Edge Coloring of Graphs and Dimension of Lattices.
Comb.
András Gyárfás
2001 J jnl
Anti-Ramsey Colorings in Several Rounds.
J. Comb. Theory B
Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó
2001 J jnl
Convex Sets in the Plane with Three of Every Four Meeting.
Comb.
Daniel J. Kleitman, András Gyárfás, Géza Tóth
2001 J jnl
On the Maximum Size of (p, Q) - free Families.
Electron. Notes Discret. Math.
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
2001 J jnl
Transitive tournaments and self-complementary graphs.
J. Graph Theory
András Gyárfás
2000 J jnl
Decreasing the diameter of bounded degree graphs.
J. Graph Theory
Noga Alon, András Gyárfás, Miklós Ruszinkó
1999 J jnl
Extremal problems for forbidden pairs that imply hamiltonicity.
Discuss. Math. Graph Theory
Ralph J. Faudree, András Gyárfás
1999 — ch.
Graph Theory.
Handbook of Discrete and Combinatorial Mathematics
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
1999 J jnl
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discret. Math.
András Gyárfás, Zoltán Király, Jenö Lehel
1999 J jnl
Split and balanced colorings of complete graphs.
Discret. Math.
Paul Erdös, András Gyárfás
1998 J jnl
2-Partition-Transitive Tournaments.
J. Comb. Theory B
Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl
1998 J jnl
A Communication Problem and Directed Triple Systems.
Discret. Appl. Math.
András Gyárfás, Richard H. Schelp
1998 J jnl
Generalized Split Graphs and Ramsey Numbers.
J. Comb. Theory A
András Gyárfás
1998 J jnl
How to decrease the diameter of triangle-free graphs.
Comb.
Paul Erdös, András Gyárfás, Miklós Ruszinkó
1998 J jnl
Vertex colorings with a distance restriction.
Discret. Math.
Guantao Chen, András Gyárfás, Richard H. Schelp
1997 J jnl
A Class of Edge Critical 4-Chromatic Graphs.
Graphs Comb.
Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp
1997 J jnl
A Variant of the Classical Ramsey Problem.
Comb.
Paul Erdös, András Gyárfás
1997 J jnl
Fruit Salad.
Electron. J. Comb.
András Gyárfás
1997 J jnl
On-line 3-chromatic graphs - II critical graphs.
Discret. Math.
András Gyárfás, Zoltán Király, Jenö Lehel
1997 J jnl
The size of the largest bipartite subgraphs.
Discret. Math.
Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
1996 J jnl
An edge coloring problem for graph products.
J. Graph Theory
Ralph J. Faudree, András Gyárfás, Richard H. Schelp
1996 J jnl
Endpoint extendable paths in tournaments.
J. Graph Theory
Ralph J. Faudree, András Gyárfás
1996 J jnl
Graphs in which each C
Discret. Math.
Paul Erdös, András Gyárfás, Tomasz Luczak
1996 J jnl
Minimal non-neighborhood-perfect graphs.
J. Graph Theory
András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray
1995 J jnl
Linear Sets with Five Distinct Differences among Any Four Elements.
J. Comb. Theory B
András Gyárfás, Jenö Lehel
1994 J jnl
Independet Transversals in Sparse Partite Hypergraphs.
Comb. Probab. Comput.
Paul Erdös, András Gyárfás, Tomasz Luczak
1994 J jnl
On the rotation distance of graphs.
Discret. Math.
Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
1993 J jnl
Rainbow coloring the cube.
J. Graph Theory
Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp
1992 J jnl
Graphs with k odd cycle lengths.
Discret. Math.
András Gyárfás
1992 J jnl
Networks communicating for each pairing of terminals.
Networks
László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
1992 J jnl
On the irregularity strength of the
J. Graph Theory
Jeffrey H. Dinitz, David K. Garnick, András Gyárfás
1992 J jnl
Three-regular path pairable graphs.
Graphs Comb.
Ralph J. Faudree, András Gyárfás, Jenö Lehel
1991 J jnl
Covering t-element Sets by Partitions.
Eur. J. Comb.
Zoltán Füredi, András Gyárfás
1991 J jnl
Effective on-line coloring of P
Comb.
András Gyárfás, Jenö Lehel
1991 J jnl
Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory B
Paul Erdös, András Gyárfás, László Pyber
1990 J jnl
A simple lower bound on edge coverings by cliques.
Discret. Math.
András Gyárfás
1990 J jnl
The maximum number of edges in 2K
Discret. Math.
Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter
1989 J jnl
Domination in colored complete graphs.
J. Graph Theory
Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp
1989 J jnl
Induced matchings in bipartite graphs.
Discret. Math.
Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza
1989 J jnl
The size of chordal, interval and threshold subgraphs.
Comb.
Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein
1988 J jnl
Clumsy packing of dominoes.
Discret. Math.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1988 J jnl
On a generalization of transitivity for digraphs.
Discret. Math.
András Gyárfás, Michael S. Jacobson, Lael F. Kinch
1988 J jnl
On-line and first fit colorings of graphs.
J. Graph Theory
András Gyárfás, Jenö Lehel
1988 J jnl
The irregularity strength of K
Discret. Math.
András Gyárfás
1987 J jnl
An upper bound on the Ramsey number of trees.
Discret. Math.
András Gyárfás, Zsolt Tuza
1987 J jnl
Local
J. Comb. Theory B
András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
1987 J jnl
Ramsey numbers for local colorings.
Graphs Comb.
András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza
1986 J jnl
Corrigendum.
Discret. Math.
András Gyárfás
1985 J jnl
Covering and coloring problems for relatives of intervals.
Discret. Math.
András Gyárfás, Jenö Lehel
1985 J jnl
How many atoms can be defined by boxes.
Comb.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1985 J jnl
On the chromatic number of multiple interval graphs and overlap graphs.
Discret. Math.
András Gyárfás
1985 J jnl
On the sum of the reciprocals of cycle lengths in sparse graphs.
Comb.
András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt
1984 J jnl
An extremal problem for paths in bipartite graphs.
J. Graph Theory
András Gyárfás, Cecil C. Rousseau, Richard H. Schelp
1984 J jnl
On the distribution of cycle lengths in graphs.
J. Graph Theory
András Gyárfás, János Komlós, Endre Szemerédi
1984 J jnl
The structure of rectangle families dividing the plane into maximum number of atoms.
Discret. Math.
András Gyárfás, Jenö Lehel, Zsolt Tuza
1983 J jnl
Hypergraph families with bounded edge cover or transversal number.
Comb.
András Gyárfás, Jenö Lehel
1983 J jnl
Vertex coverings by monochromatic paths and cycles.
J. Graph Theory
András Gyárfás
1980 J jnl
Induced subtrees in graphs of large chromatic number.
Discret. Math.
András Gyárfás, Endre Szemerédi, Zsolt Tuza
1980 J jnl
Still another triangle-free infinite-chromatic graph.
Discret. Math.
András Gyárfás
1978 J jnl
A note on hypergraphs with the Helly-property.
Discret. Math.
András Gyárfás