András Gyárfás

According to our database1, András Gyárfás authored at least 131 papers between 1978 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 





The Turán Number of Berge K_4 in Triple Systems.
SIAM J. Discrete Math., 2019

A note on Ramsey numbers for Berge-G hypergraphs.
Discrete Mathematics, 2019

Uniquely $K_r^{(k)}$-Saturated Hypergraphs.
Electr. J. Comb., 2018

Cliques in \(C_4\) -free graphs of large minimum degree.
Periodica Mathematica Hungarica, 2017

Rainbow matchings in bipartite multigraphs.
Periodica Mathematica Hungarica, 2017

Chromatic Ramsey number of acyclic hypergraphs.
Discrete Mathematics, 2017

Covering complete partite hypergraphs by monochromatic components.
Discrete Mathematics, 2017

Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
Electr. J. Comb., 2017

Ramsey Number of a Connected Triangle Matching.
Journal of Graph Theory, 2016

Vertex covers by monochromatic pieces - A survey of results and problems.
Discrete Mathematics, 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.
Discrete Mathematics, 2016

Induced Colorful Trees and Paths in Large Chromatic Graphs.
Electr. J. Comb., 2016

Red-Blue Clique Partitions and (1-1)-Transversals.
Electr. J. Comb., 2016

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs and Combinatorics, 2015

Domination in transitive colorings of tournaments.
J. Comb. Theory, Ser. B, 2014

List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs and Combinatorics, 2014

Packing trees into n-chromatic graphs.
Discussiones Mathematicae Graph Theory, 2014

Rainbow matchings and cycle-free partial transversals of Latin squares.
Discrete Mathematics, 2014

Multicolor Ramsey numbers for triple systems.
Discrete Mathematics, 2014

Monochromatic Loose-cycle Partitions in Hypergraphs.
Electr. J. Comb., 2014

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electr. J. Comb., 2014

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

Disconnected Colors in Generalized Gallai-Colorings.
Journal of Graph Theory, 2013

Monochromatic Path and Cycle Partitions in Hypergraphs.
Electr. J. Comb., 2013

Coloring 2-Intersecting Hypergraphs.
Electr. J. Comb., 2013

Reflections on a Problem of Erdős and Hajnal.
Proceedings of the Mathematics of Paul Erdős II, 2013

Gallai colorings and domination in multipartite digraphs.
Journal of Graph Theory, 2012

New Bounds on the Grundy Number of Products of Graphs.
Journal of Graph Theory, 2012

The chromatic gap and its extremes.
J. Comb. Theory, Ser. B, 2012

Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp.
Combinatorics, Probability & Computing, 2012

The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs.
Electr. J. Comb., 2012

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electr. J. Comb., 2012

Monochromatic even cycles.
Contributions to Discrete Mathematics, 2012

Trees in greedy colorings of hypergraphs.
Discrete Mathematics, 2011

The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.
Combinatorics, Probability & Computing, 2011

On (δ, χ)-Bounded Families of Graphs.
Electr. J. Comb., 2011

Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electr. J. Comb., 2011

Long rainbow cycles in proper edge-colorings of complete graphs.
Australasian J. Combinatorics, 2011

Ramsey-type results for Gallai colorings.
Journal of Graph Theory, 2010

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
Journal of Graph Theory, 2010

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs and Combinatorics, 2010

Gallai colorings of non-complete graphs.
Discrete Mathematics, 2010

Multipartite Ramsey numbers for odd cycles.
Journal of Graph Theory, 2009

Stability of the path-path Ramsey number.
Discrete Mathematics, 2009

Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discrete Mathematics, 2009

Inequalities for the first-fit chromatic number.
Journal of Graph Theory, 2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory, Ser. B, 2008

Size of Monochromatic Double Stars in Edge Colorings.
Graphs and Combinatorics, 2008

Ramsey and Turán-type problems in bipartite geometric graphs.
Electronic Notes in Discrete Mathematics, 2008

Size of monochromatic components in local edge colorings.
Discrete Mathematics, 2008

Highly connected monochromatic subgraphs.
Discrete Mathematics, 2008

Disjoint chorded cycles in graphs.
Discrete Mathematics, 2008

The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electr. J. Comb., 2008

Three-color Ramsey numbers for paths.
Combinatorica, 2008

Tripartite Ramsey numbers for paths.
Journal of Graph Theory, 2007

Finding a monochromatic subgraph or a rainbow path.
Journal of Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.
Journal of Graph Theory, 2007

Three-Color Ramsey Numbers For Paths.
Combinatorica, 2007

An improved bound for the monochromatic cycle partition number.
J. Comb. Theory, Ser. B, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory, Ser. A, 2006

Odd cycles and Theta-cycles in hypergraphs.
Discrete Mathematics, 2006

Hall ratio of the Mycielski graphs.
Discrete Mathematics, 2006

Semistrong edge coloring of graphs.
Journal of Graph Theory, 2005

Connected matchings and Hadwiger's conjecture.
Combinatorics, Probability & Computing, 2005

Coloring the Maximal Cliques of Graphs.
SIAM J. Discrete Math., 2004

Edge colorings of complete graphs without tricolored triangles.
Journal of Graph Theory, 2004

On graphs with strongly independent color-classes.
Journal of Graph Theory, 2004

Edge list multicoloring trees: An extension of Hall's theorem.
Journal of Graph Theory, 2003

A finite basis characterization of ?-split colorings.
Discrete Mathematics, 2002

On the maximum size of (p, Q)-free families.
Discrete Mathematics, 2002

Large Cliques in C4-Free Graphs.
Combinatorica, 2002

Transitive Edge Coloring of Graphs and Dimension of Lattices.
Combinatorica, 2002

Transitive tournaments and self-complementary graphs.
Journal of Graph Theory, 2001

Anti-Ramsey Colorings in Several Rounds.
J. Comb. Theory, Ser. B, 2001

On the Maximum Size of (p, Q) - free Families.
Electronic Notes in Discrete Mathematics, 2001

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

Decreasing the diameter of bounded degree graphs.
Journal of Graph Theory, 2000

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

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discrete Math., 1999

Extremal problems for forbidden pairs that imply hamiltonicity.
Discussiones Mathematicae Graph Theory, 1999

Split and balanced colorings of complete graphs.
Discrete Mathematics, 1999

Generalized Split Graphs and Ramsey Numbers.
J. Comb. Theory, Ser. A, 1998

2-Partition-Transitive Tournaments.
J. Comb. Theory, Ser. B, 1998

Vertex colorings with a distance restriction.
Discrete Mathematics, 1998

A Communication Problem and Directed Triple Systems.
Discrete Applied Mathematics, 1998

How to decrease the diameter of triangle-free graphs.
Combinatorica, 1998

A Class of Edge Critical 4-Chromatic Graphs.
Graphs and Combinatorics, 1997

On-line 3-chromatic graphs - II critical graphs.
Discrete Mathematics, 1997

The size of the largest bipartite subgraphs.
Discrete Mathematics, 1997

Fruit Salad.
Electr. J. Comb., 1997

A Variant of the Classical Ramsey Problem.
Combinatorica, 1997

Minimal non-neighborhood-perfect graphs.
Journal of Graph Theory, 1996

An edge coloring problem for graph products.
Journal of Graph Theory, 1996

Endpoint extendable paths in tournaments.
Journal of Graph Theory, 1996

Graphs in which each C4 spans K4.
Discrete Mathematics, 1996

Linear Sets with Five Distinct Differences among Any Four Elements.
J. Comb. Theory, Ser. B, 1995

On the rotation distance of graphs.
Discrete Mathematics, 1994

Independet Transversals in Sparse Partite Hypergraphs.
Combinatorics, Probability & Computing, 1994

Rainbow coloring the cube.
Journal of Graph Theory, 1993

Networks communicating for each pairing of terminals.
Networks, 1992

On the irregularity strength of the m × n grid.
Journal of Graph Theory, 1992

Three-regular path pairable graphs.
Graphs and Combinatorics, 1992

Graphs with k odd cycle lengths.
Discrete Mathematics, 1992

Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory, Ser. B, 1991

Covering t-element Sets by Partitions.
Eur. J. Comb., 1991

Effective on-line coloring of P5-free graphs.
Combinatorica, 1991

A simple lower bound on edge coverings by cliques.
Discrete Mathematics, 1990

The maximum number of edges in 2K2-free graphs of bounded degree.
Discrete Mathematics, 1990

Domination in colored complete graphs.
Journal of Graph Theory, 1989

Induced matchings in bipartite graphs.
Discrete Mathematics, 1989

The size of chordal, interval and threshold subgraphs.
Combinatorica, 1989

On-line and first fit colorings of graphs.
Journal of Graph Theory, 1988

Clumsy packing of dominoes.
Discrete Mathematics, 1988

On a generalization of transitivity for digraphs.
Discrete Mathematics, 1988

The irregularity strength of Km, m is 4 for odd m.
Discrete Mathematics, 1988

Local k-colorings of graphs and hypergraphs.
J. Comb. Theory, Ser. B, 1987

Ramsey numbers for local colorings.
Graphs and Combinatorics, 1987

An upper bound on the Ramsey number of trees.
Discrete Mathematics, 1987

Discrete Mathematics, 1986

Covering and coloring problems for relatives of intervals.
Discrete Mathematics, 1985

On the chromatic number of multiple interval graphs and overlap graphs.
Discrete Mathematics, 1985

On the sum of the reciprocals of cycle lengths in sparse graphs.
Combinatorica, 1985

How many atoms can be defined by boxes.
Combinatorica, 1985

An extremal problem for paths in bipartite graphs.
Journal of Graph Theory, 1984

On the distribution of cycle lengths in graphs.
Journal of Graph Theory, 1984

The structure of rectangle families dividing the plane into maximum number of atoms.
Discrete Mathematics, 1984

Vertex coverings by monochromatic paths and cycles.
Journal of Graph Theory, 1983

Hypergraph families with bounded edge cover or transversal number.
Combinatorica, 1983

Induced subtrees in graphs of large chromatic number.
Discrete Mathematics, 1980

Still another triangle-free infinite-chromatic graph.
Discrete Mathematics, 1980

A note on hypergraphs with the Helly-property.
Discrete Mathematics, 1978