According to our database
1,
András Gyárfás
authored at least 146 papers
between 1978 and 2024.
Collaborative distances:
2024
Monochromatic spanning trees and matchings in ordered complete graphs.
J. Graph Theory, April, 2024
2023
Proper Edge Colorings of Cartesian Products with Rainbow C<sub>4</sub>-s.
Graphs Comb., October, 2023
Problems close to my heart.
Eur. J. Comb., June, 2023
2022
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs.
J. Graph Theory, 2022
Linear Turán numbers of acyclic triple systems.
Eur. J. Comb., 2022
The linear Turán number of small triple systems or why is the wicket interesting?
Discret. Math., 2022
Turán number of special four cycles in triple systems.
Discret. Math., 2022
Crowns in Linear $3$-Graphs of Minimum Degree $4$.
Electron. J. Comb., 2022
2021
Order plus size of 𝜏-critical graphs.
J. Graph Theory, 2021
Ramsey numbers of path-matchings, covering designs, and 1-cores.
J. Comb. Theory, Ser. B, 2021
Turán and Ramsey numbers in linear triple systems.
Discret. Math., 2021
2020
An Extension of Mantel's Theorem to k-Graphs.
Am. Math. Mon., 2020
Distribution of colors in Gallai colorings.
Eur. J. Comb., 2020
Matchings with few colors in colored complete graphs and hypergraphs.
Discret. Math., 2020
2019
The Turán Number of Berge K_4 in Triple Systems.
SIAM J. Discret. Math., 2019
A note on Ramsey numbers for Berge-G hypergraphs.
Discret. Math., 2019
Partitioning the Power Set of [n] into C<sub>k</sub>-free parts.
Electron. J. Comb., 2019
2018
Large Sets of t-designs and a Ramsey-type Problem.
Integers, 2018
Uniquely K<sub>r</sub><sup>(k)</sup>-Saturated Hypergraphs.
Electron. J. Comb., 2018
2017
Cliques in \(C_4\) -free graphs of large minimum degree.
Period. Math. Hung., 2017
Rainbow matchings in bipartite multigraphs.
Period. Math. Hung., 2017
Chromatic Ramsey number of acyclic hypergraphs.
Discret. Math., 2017
Covering complete partite hypergraphs by monochromatic components.
Discret. Math., 2017
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition.
Electron. J. Comb., 2017
2016
Ramsey Number of a Connected Triangle Matching.
J. Graph Theory, 2016
Vertex covers by monochromatic pieces - A survey of results and problems.
Discret. Math., 2016
Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math., 2016
Induced Colorful Trees and Paths in Large Chromatic Graphs.
Electron. J. Comb., 2016
Red-Blue Clique Partitions and (1-1)-Transversals.
Electron. J. Comb., 2016
2015
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs Comb., 2015
2014
Domination in transitive colorings of tournaments.
J. Comb. Theory, Ser. B, 2014
List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs Comb., 2014
Packing trees into <i>n</i>-chromatic graphs.
Discuss. Math. Graph Theory, 2014
Rainbow matchings and cycle-free partial transversals of Latin squares.
Discret. Math., 2014
Multicolor Ramsey numbers for triple systems.
Discret. Math., 2014
Monochromatic Loose-cycle Partitions in Hypergraphs.
Electron. J. Comb., 2014
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electron. J. Comb., 2014
Partitioning 2-edge-colored graphs by monochromatic paths and cycles.
Comb., 2014
2013
Disconnected Colors in Generalized Gallai-Colorings.
J. Graph Theory, 2013
Monochromatic Path and Cycle Partitions in Hypergraphs.
Electron. J. Comb., 2013
Coloring 2-Intersecting Hypergraphs.
Electron. J. Comb., 2013
Reflections on a Problem of Erdős and Hajnal.
Proceedings of the Mathematics of Paul Erdős II, 2013
2012
Gallai colorings and domination in multipartite digraphs.
J. Graph Theory, 2012
New Bounds on the Grundy Number of Products of Graphs.
J. 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.
Comb. Probab. Comput., 2012
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs.
Electron. J. Comb., 2012
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electron. J. Comb., 2012
Monochromatic even cycles.
Contributions Discret. Math., 2012
2011
Trees in greedy colorings of hypergraphs.
Discret. Math., 2011
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle.
Comb. Probab. Comput., 2011
On (δ, χ)-Bounded Families of Graphs.
Electron. J. Comb., 2011
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles.
Electron. J. Comb., 2011
Long rainbow cycles in proper edge-colorings of complete graphs.
Australas. J Comb., 2011
2010
Ramsey-type results for Gallai colorings.
J. Graph Theory, 2010
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs.
J. Graph Theory, 2010
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs.
Graphs Comb., 2010
Gallai colorings of non-complete graphs.
Discret. Math., 2010
2009
Multipartite Ramsey numbers for odd cycles.
J. Graph Theory, 2009
Stability of the path-path Ramsey number.
Discret. Math., 2009
Large monochromatic components in colorings of complete 3-uniform hypergraphs.
Discret. Math., 2009
2008
Inequalities for the first-fit chromatic number.
J. 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 Comb., 2008
Ramsey and Turán-type problems in bipartite geometric graphs.
Electron. Notes Discret. Math., 2008
Size of monochromatic components in local edge colorings.
Discret. Math., 2008
Highly connected monochromatic subgraphs.
Discret. Math., 2008
Disjoint chorded cycles in graphs.
Discret. Math., 2008
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
Electron. J. Comb., 2008
2007
Tripartite Ramsey numbers for paths.
J. Graph Theory, 2007
Finding a monochromatic subgraph or a rainbow path.
J. Graph Theory, 2007
Maximum directed cuts in acyclic digraphs.
J. Graph Theory, 2007
Three-Color Ramsey Numbers For Paths.
Comb., 2007
2006
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.
Discret. Math., 2006
Hall ratio of the Mycielski graphs.
Discret. Math., 2006
2005
Semistrong edge coloring of graphs.
J. Graph Theory, 2005
Connected matchings and Hadwiger's conjecture.
Comb. Probab. Comput., 2005
2004
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math., 2004
Edge colorings of complete graphs without tricolored triangles.
J. Graph Theory, 2004
On graphs with strongly independent color-classes.
J. Graph Theory, 2004
2003
Edge list multicoloring trees: An extension of Hall's theorem.
J. Graph Theory, 2003
2002
A finite basis characterization of ?-split colorings.
Discret. Math., 2002
On the maximum size of (<i>p, Q</i>)-free families.
Discret. Math., 2002
Large Cliques in <i>C</i><sub>4</sub>-Free Graphs.
Comb., 2002
Transitive Edge Coloring of Graphs and Dimension of Lattices.
Comb., 2002
2001
Transitive tournaments and self-complementary graphs.
J. Graph Theory, 2001
Anti-Ramsey Colorings in Several Rounds.
J. Comb. Theory, Ser. B, 2001
On the Maximum Size of (p, Q) - free Families.
Electron. Notes Discret. Math., 2001
Convex Sets in the Plane with Three of Every Four Meeting.
Comb., 2001
2000
Decreasing the diameter of bounded degree graphs.
J. Graph Theory, 2000
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discret. Math., 1999
Extremal problems for forbidden pairs that imply hamiltonicity.
Discuss. Math. Graph Theory, 1999
Split and balanced colorings of complete graphs.
Discret. Math., 1999
1998
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.
Discret. Math., 1998
A Communication Problem and Directed Triple Systems.
Discret. Appl. Math., 1998
How to decrease the diameter of triangle-free graphs.
Comb., 1998
1997
A Class of Edge Critical 4-Chromatic Graphs.
Graphs Comb., 1997
On-line 3-chromatic graphs - II critical graphs.
Discret. Math., 1997
The size of the largest bipartite subgraphs.
Discret. Math., 1997
A Variant of the Classical Ramsey Problem.
Comb., 1997
1996
Minimal non-neighborhood-perfect graphs.
J. Graph Theory, 1996
An edge coloring problem for graph products.
J. Graph Theory, 1996
Endpoint extendable paths in tournaments.
J. Graph Theory, 1996
Graphs in which each C<sub>4</sub> spans K<sub>4</sub>.
Discret. Math., 1996
1995
Linear Sets with Five Distinct Differences among Any Four Elements.
J. Comb. Theory, Ser. B, 1995
1994
On the rotation distance of graphs.
Discret. Math., 1994
Independet Transversals in Sparse Partite Hypergraphs.
Comb. Probab. Comput., 1994
1993
Rainbow coloring the cube.
J. Graph Theory, 1993
1992
Networks communicating for each pairing of terminals.
Networks, 1992
On the irregularity strength of the <i>m</i> × <i>n</i> grid.
J. Graph Theory, 1992
Three-regular path pairable graphs.
Graphs Comb., 1992
Graphs with k odd cycle lengths.
Discret. Math., 1992
1991
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 P<sub>5</sub>-free graphs.
Comb., 1991
1990
A simple lower bound on edge coverings by cliques.
Discret. Math., 1990
The maximum number of edges in 2K<sub>2</sub>-free graphs of bounded degree.
Discret. Math., 1990
1989
Domination in colored complete graphs.
J. Graph Theory, 1989
Induced matchings in bipartite graphs.
Discret. Math., 1989
The size of chordal, interval and threshold subgraphs.
Comb., 1989
1988
On-line and first fit colorings of graphs.
J. Graph Theory, 1988
Clumsy packing of dominoes.
Discret. Math., 1988
On a generalization of transitivity for digraphs.
Discret. Math., 1988
The irregularity strength of K<sub>m, m</sub> is 4 for odd m.
Discret. Math., 1988
1987
Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory, Ser. B, 1987
Ramsey numbers for local colorings.
Graphs Comb., 1987
An upper bound on the Ramsey number of trees.
Discret. Math., 1987
1986
1985
Covering and coloring problems for relatives of intervals.
Discret. Math., 1985
On the chromatic number of multiple interval graphs and overlap graphs.
Discret. Math., 1985
On the sum of the reciprocals of cycle lengths in sparse graphs.
Comb., 1985
How many atoms can be defined by boxes.
Comb., 1985
1984
An extremal problem for paths in bipartite graphs.
J. Graph Theory, 1984
On the distribution of cycle lengths in graphs.
J. Graph Theory, 1984
The structure of rectangle families dividing the plane into maximum number of atoms.
Discret. Math., 1984
1983
Vertex coverings by monochromatic paths and cycles.
J. Graph Theory, 1983
Hypergraph families with bounded edge cover or transversal number.
Comb., 1983
1980
Induced subtrees in graphs of large chromatic number.
Discret. Math., 1980
Still another triangle-free infinite-chromatic graph.
Discret. Math., 1980
1978
A note on hypergraphs with the Helly-property.
Discret. Math., 1978
