András Gyárfás

According to our database, András Gyárfás authored at least 147 papers between 1978 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2024

Monochromatic spanning trees and matchings in ordered complete graphs.

János Barát, András Gyárfás, Géza Tóth

J. Graph Theory, April, 2024

2023

Proper Edge Colorings of Cartesian Products with Rainbow C₄-s.

András Gyárfás, Gábor N. Sárközy

Graphs Comb., October, 2023

Problems close to my heart.

András Gyárfás

Eur. J. Comb., June, 2023

Problems and results on 1-cross-intersecting set pair systems.

Zoltán Füredi, András Gyárfás, Zoltán Király

Comb. Probab. Comput., 2023

2022

Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs.

Louis DeBiasio, András Gyárfás

J. Graph Theory, 2022

Linear Turán numbers of acyclic triple systems.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy

Eur. J. Comb., 2022

The linear Turán number of small triple systems or why is the wicket interesting?

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2022

Turán number of special four cycles in triple systems.

Zoltán Füredi, András Gyárfás, Attila Sali

Discret. Math., 2022

Crowns in Linear $3$-Graphs of Minimum Degree $4$.

Alvaro Carbonero, Willem Fletcher, Jing Guo, András Gyárfás, Rona Wang, Shiyu Yan

Electron. J. Comb., 2022

2021

Order plus size of 𝜏-critical graphs.

András Gyárfás, Jeno Lehel

J. Graph Theory, 2021

Ramsey numbers of path-matchings, covering designs, and 1-cores.

Louis DeBiasio, András Gyárfás, Gábor N. Sárközy

J. Comb. Theory B, 2021

Turán and Ramsey numbers in linear triple systems.

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2021

2020

An Extension of Mantel's Theorem to k-Graphs.

Zoltán Füredi, András Gyárfás

Am. Math. Mon., 2020

Distribution of colors in Gallai colorings.

András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós, Matthew Wales

Eur. J. Comb., 2020

Matchings with few colors in colored complete graphs and hypergraphs.

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2020

2019

The Turán Number of Berge K_4 in Triple Systems.

András Gyárfás

SIAM J. Discret. Math., 2019

A note on Ramsey numbers for Berge-G hypergraphs.

Maria Axenovich, András Gyárfás

Discret. Math., 2019

Partitioning the Power Set of [n] into C_k-free parts.

Eben Blaisdell, András Gyárfás, Robert A. Krueger, Ronen Wdowinski

Electron. J. Comb., 2019

2018

Large Sets of t-designs and a Ramsey-type Problem.

András Gyárfás

Integers, 2018

Uniquely K_r^(k)-Saturated Hypergraphs.

András Gyárfás, Stephen G. Hartke, Charles Viss

Electron. J. Comb., 2018

2017

Cliques in \(C_4\) -free graphs of large minimum degree.

András Gyárfás, Gábor N. Sárközy

Period. Math. Hung., 2017

Rainbow matchings in bipartite multigraphs.

János Barát, András Gyárfás, Gábor N. Sárközy

Period. Math. Hung., 2017

Chromatic Ramsey number of acyclic hypergraphs.

András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett

Discret. Math., 2017

Covering complete partite hypergraphs by monochromatic components.

András Gyárfás, Zoltán Király

Discret. Math., 2017

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.

András Gyárfás, Gábor N. Sárközy

Electron. J. Comb., 2017

2016

Ramsey Number of a Connected Triangle Matching.

András Gyárfás, Gábor N. Sárközy

J. Graph Theory, 2016

Vertex covers by monochromatic pieces - A survey of results and problems.

András Gyárfás

Discret. Math., 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.

János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy

Discret. Math., 2016

Induced Colorful Trees and Paths in Large Chromatic Graphs.

András Gyárfás, Gábor N. Sárközy

Electron. J. Comb., 2016

Red-Blue Clique Partitions and (1-1)-Transversals.

András Gyárfás, Jeno Lehel

Electron. J. Comb., 2016

2015

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.

András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow

Graphs Comb., 2015

2014

Domination in transitive colorings of tournaments.

Dömötör Pálvölgyi, András Gyárfás

J. Comb. Theory B, 2014

List-Coloring Claw-Free Graphs with Small Clique Number.

Louis Esperet, András Gyárfás, Frédéric Maffray

Graphs Comb., 2014

Packing trees into <i>n</i>-chromatic graphs.

András Gyárfás

Discuss. Math. Graph Theory, 2014

Rainbow matchings and cycle-free partial transversals of Latin squares.

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2014

Multicolor Ramsey numbers for triple systems.

Maria Axenovich, András Gyárfás, Hong Liu, Dhruv Mubayi

Discret. Math., 2014

Monochromatic Loose-cycle Partitions in Hypergraphs.

András Gyárfás, Gábor N. Sárközy

Electron. J. Comb., 2014

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.

Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth

Electron. J. Comb., 2014

Partitioning 2-edge-colored graphs by monochromatic paths and cycles.

József Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy

Comb., 2014

2013

Disconnected Colors in Generalized Gallai-Colorings.

Shinya Fujita, András Gyárfás, Colton Magnant, Ákos Seress

J. Graph Theory, 2013

Monochromatic Path and Cycle Partitions in Hypergraphs.

András Gyárfás, Gábor N. Sárközy

Electron. J. Comb., 2013

Coloring 2-Intersecting Hypergraphs.

Lucas Colucci, András Gyárfás

Electron. J. Comb., 2013

Reflections on a Problem of Erdős and Hajnal.

András Gyárfás

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Gallai colorings and domination in multipartite digraphs.

András Gyárfás, Gábor Simonyi, Ágnes Tóth

J. Graph Theory, 2012

New Bounds on the Grundy Number of Products of Graphs.

Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray

J. Graph Theory, 2012

The chromatic gap and its extremes.

András Gyárfás, András Sebö, Nicolas Trotignon

J. Comb. Theory B, 2012

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp.

András Gyárfás, Gábor N. Sárközy

Comb. Probab. Comput., 2012

The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs.

András Gyárfás, Ghaffar Raeisi

Electron. J. Comb., 2012

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.

Shinya Fujita, Michitaka Furuya, András Gyárfás, Ágnes Tóth

Electron. J. Comb., 2012

Monochromatic even cycles.

András Gyárfás, Dömötör Pálvölgyi

Contributions Discret. Math., 2012

2011

Trees in greedy colorings of hypergraphs.

András Gyárfás, Jenö Lehel

Discret. Math., 2011

The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.

András Gyárfás, Gábor N. Sárközy

Comb. Probab. Comput., 2011

On (δ, χ)-Bounded Families of Graphs.

András Gyárfás, Manouchehr Zaker

Electron. J. Comb., 2011

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Electron. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Richard H. Schelp

Australas. J Comb., 2011

2010

Ramsey-type results for Gallai colorings.

András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow

J. Graph Theory, 2010

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

J. Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Graphs Comb., 2010

Gallai colorings of non-complete graphs.

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2010

2009

Multipartite Ramsey numbers for odd cycles.

András Gyárfás, Gábor N. Sárközy, Richard H. Schelp

J. Graph Theory, 2009

Stability of the path-path Ramsey number.

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Discret. Math., 2009

Large monochromatic components in colorings of complete 3-uniform hypergraphs.

András Gyárfás, Penny E. Haxell

Discret. Math., 2009

2008

Inequalities for the first-fit chromatic number.

Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow

J. Graph Theory, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp

J. Comb. Theory B, 2008

Size of Monochromatic Double Stars in Edge Colorings.

András Gyárfás, Gábor N. Sárközy

Graphs Comb., 2008

Ramsey and Turán-type problems in bipartite geometric graphs.

András Gyárfás

Electron. Notes Discret. Math., 2008

Size of monochromatic components in local edge colorings.

András Gyárfás, Gábor N. Sárközy

Discret. Math., 2008

Highly connected monochromatic subgraphs.

Béla Bollobás, András Gyárfás

Discret. Math., 2008

Disjoint chorded cycles in graphs.

Arie Bialostocki, Daniel Finkel, András Gyárfás

Discret. Math., 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Electron. J. Comb., 2008

Three-color Ramsey numbers for paths.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Comb., 2008

2007

Tripartite Ramsey numbers for paths.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

J. Graph Theory, 2007

Finding a monochromatic subgraph or a rainbow path.

András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.

Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott

J. Graph Theory, 2007

2006

An improved bound for the monochromatic cycle partition number.

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

J. Comb. Theory B, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.

Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Comb. Theory A, 2006

Odd cycles and Theta-cycles in hypergraphs.

András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Discret. Math., 2006

Hall ratio of the Mycielski graphs.

Mathew Cropper, András Gyárfás, Jenö Lehel

Discret. Math., 2006

2005

Semistrong edge coloring of graphs.

András Gyárfás, Alice Hubenko

J. Graph Theory, 2005

Connected matchings and Hadwiger's conjecture.

Zoltán Füredi, András Gyárfás, Gábor Simonyi

Comb. Probab. Comput., 2005

2004

Coloring the Maximal Cliques of Graphs.

Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö

SIAM J. Discret. Math., 2004

Edge colorings of complete graphs without tricolored triangles.

András Gyárfás, Gábor Simonyi

J. Graph Theory, 2004

On graphs with strongly independent color-classes.

András Gyárfás, Tommy Jensen, Michael Stiebitz

J. Graph Theory, 2004

2003

Edge list multicoloring trees: An extension of Hall's theorem.

Mathew Cropper, András Gyárfás, Jenö Lehel

J. Graph Theory, 2003

2002

A finite basis characterization of ?-split colorings.

András Gyárfás, André E. Kézdy, Jenö Lehel

Discret. Math., 2002

On the maximum size of (<i>p, Q</i>)-free families.

Zoltán Füredi, András Gyárfás, Miklós Ruszinkó

Discret. Math., 2002

Large Cliques in <i>C</i>₄-Free Graphs.

András Gyárfás, Alice Hubenko, József Solymosi

Comb., 2002

Transitive Edge Coloring of Graphs and Dimension of Lattices.

András Gyárfás

Comb., 2002

2001

Transitive tournaments and self-complementary graphs.

András Gyárfás

J. Graph Theory, 2001

Anti-Ramsey Colorings in Several Rounds.

Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó

J. Comb. Theory B, 2001

On the Maximum Size of (p, Q) - free Families.

Zoltán Füredi, András Gyárfás, Miklós Ruszinkó

Electron. Notes Discret. Math., 2001

Convex Sets in the Plane with Three of Every Four Meeting.

Daniel J. Kleitman, András Gyárfás, Géza Tóth

Comb., 2001

2000

Decreasing the diameter of bounded degree graphs.

Noga Alon, András Gyárfás, Miklós Ruszinkó

J. Graph Theory, 2000

1999

Graph Theory.

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

Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.

András Gyárfás, Zoltán Király, Jenö Lehel

SIAM J. Discret. Math., 1999

Extremal problems for forbidden pairs that imply hamiltonicity.

Ralph J. Faudree, András Gyárfás

Discuss. Math. Graph Theory, 1999

Split and balanced colorings of complete graphs.

Paul Erdös, András Gyárfás

Discret. Math., 1999

1998

Generalized Split Graphs and Ramsey Numbers.

András Gyárfás

J. Comb. Theory A, 1998

2-Partition-Transitive Tournaments.

Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl

J. Comb. Theory B, 1998

Vertex colorings with a distance restriction.

Guantao Chen, András Gyárfás, Richard H. Schelp

Discret. Math., 1998

A Communication Problem and Directed Triple Systems.

András Gyárfás, Richard H. Schelp

Discret. Appl. Math., 1998

How to decrease the diameter of triangle-free graphs.

Paul Erdös, András Gyárfás, Miklós Ruszinkó

Comb., 1998

1997

A Class of Edge Critical 4-Chromatic Graphs.

Guantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp

Graphs Comb., 1997

On-line 3-chromatic graphs - II critical graphs.

András Gyárfás, Zoltán Király, Jenö Lehel

Discret. Math., 1997

The size of the largest bipartite subgraphs.

Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa

Discret. Math., 1997

Fruit Salad.

András Gyárfás

Electron. J. Comb., 1997

A Variant of the Classical Ramsey Problem.

Paul Erdös, András Gyárfás

Comb., 1997

1996

Minimal non-neighborhood-perfect graphs.

András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray

J. Graph Theory, 1996

An edge coloring problem for graph products.

Ralph J. Faudree, András Gyárfás, Richard H. Schelp

J. Graph Theory, 1996

Endpoint extendable paths in tournaments.

Ralph J. Faudree, András Gyárfás

J. Graph Theory, 1996

Graphs in which each C₄ spans K₄.

Paul Erdös, András Gyárfás, Tomasz Luczak

Discret. Math., 1996

1995

Linear Sets with Five Distinct Differences among Any Four Elements.

András Gyárfás, Jenö Lehel

J. Comb. Theory B, 1995

1994

On the rotation distance of graphs.

Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel

Discret. Math., 1994

Independet Transversals in Sparse Partite Hypergraphs.

Paul Erdös, András Gyárfás, Tomasz Luczak

Comb. Probab. Comput., 1994

1993

Rainbow coloring the cube.

Ralph J. Faudree, András Gyárfás, Linda M. Lesniak, Richard H. Schelp

J. Graph Theory, 1993

1992

Networks communicating for each pairing of terminals.

László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp

Networks, 1992

On the irregularity strength of the <i>m</i> × <i>n</i> grid.

Jeffrey H. Dinitz, David K. Garnick, András Gyárfás

J. Graph Theory, 1992

Three-regular path pairable graphs.

Ralph J. Faudree, András Gyárfás, Jenö Lehel

Graphs Comb., 1992

Graphs with k odd cycle lengths.

András Gyárfás

Discret. Math., 1992

1991

Vertex coverings by monochromatic cycles and trees.

Paul Erdös, András Gyárfás, László Pyber

J. Comb. Theory B, 1991

Covering t-element Sets by Partitions.

Zoltán Füredi, András Gyárfás

Eur. J. Comb., 1991

Effective on-line coloring of P₅-free graphs.

András Gyárfás, Jenö Lehel

Comb., 1991

1990

A simple lower bound on edge coverings by cliques.

András Gyárfás

Discret. Math., 1990

The maximum number of edges in 2K₂-free graphs of bounded degree.

Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter

Discret. Math., 1990

1989

Domination in colored complete graphs.

Paul Erdös, Ralph J. Faudree, András Gyárfás, Richard H. Schelp

J. Graph Theory, 1989

Induced matchings in bipartite graphs.

Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza

Discret. Math., 1989

The size of chordal, interval and threshold subgraphs.

Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein

Comb., 1989

1988

On-line and first fit colorings of graphs.

András Gyárfás, Jenö Lehel

J. Graph Theory, 1988

Clumsy packing of dominoes.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Discret. Math., 1988

On a generalization of transitivity for digraphs.

András Gyárfás, Michael S. Jacobson, Lael F. Kinch

Discret. Math., 1988

The irregularity strength of K_{m, m} is 4 for odd m.

András Gyárfás

Discret. Math., 1988

1987

Local <i>k</i>-colorings of graphs and hypergraphs.

András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza

J. Comb. Theory B, 1987

Ramsey numbers for local colorings.

András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza

Graphs Comb., 1987

An upper bound on the Ramsey number of trees.

András Gyárfás, Zsolt Tuza

Discret. Math., 1987

1986

Corrigendum.

András Gyárfás

Discret. Math., 1986

1985

Covering and coloring problems for relatives of intervals.

András Gyárfás, Jenö Lehel

Discret. Math., 1985

On the chromatic number of multiple interval graphs and overlap graphs.

András Gyárfás

Discret. Math., 1985

On the sum of the reciprocals of cycle lengths in sparse graphs.

András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt

Comb., 1985

How many atoms can be defined by boxes.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Comb., 1985

1984

An extremal problem for paths in bipartite graphs.

András Gyárfás, Cecil C. Rousseau, Richard H. Schelp

J. Graph Theory, 1984

On the distribution of cycle lengths in graphs.

András Gyárfás, János Komlós, Endre Szemerédi

J. Graph Theory, 1984

The structure of rectangle families dividing the plane into maximum number of atoms.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Discret. Math., 1984

1983

Vertex coverings by monochromatic paths and cycles.

András Gyárfás

J. Graph Theory, 1983

Hypergraph families with bounded edge cover or transversal number.

András Gyárfás, Jenö Lehel

Comb., 1983

1980

Induced subtrees in graphs of large chromatic number.

András Gyárfás, Endre Szemerédi, Zsolt Tuza

Discret. Math., 1980

Still another triangle-free infinite-chromatic graph.

András Gyárfás

Discret. Math., 1980

1978

A note on hypergraphs with the Helly-property.

András Gyárfás

Discret. Math., 1978