András Gyárfás

From MaRDI portal
Person:228779

Available identifiers

zbMath Open gyarfas.andrasDBLP35/6794WikidataQ4759777 ScholiaQ4759777MaRDI QIDQ228779

List of research outcomes





PublicationDate of PublicationType
Proper edge colorings of planar graphs with rainbow \(C_4\)-s2025-01-06Paper
Variations of Ramsey's theme2024-12-13Paper
Monochromatic spanning trees and matchings in ordered complete graphs2024-02-23Paper
“Less” Strong Chromatic Indices and the (7, 4)-Conjecture2023-12-05Paper
Problems and results on 1-cross-intersecting set pair systems2023-11-08Paper
Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs2023-10-05Paper
Order plus size of τ‐critical graphs2023-09-29Paper
Proper edge colorings of Cartesian products with rainbow \(C_4\)-s2023-08-21Paper
Problems close to my heart2023-07-18Paper
Crowns in linear \(3\)-graphs of minimum degree \(4\)2022-11-08Paper
The linear Turán number of small triple systems or why is the wicket interesting?2022-08-24Paper
Linear Turán numbers of acyclic triple systems2021-10-28Paper
Turán number of special four cycles in triple systems2021-10-27Paper
Crowns in linear $3$-graphs2021-07-30Paper
Ramsey numbers of path-matchings, covering designs, and 1-cores2021-02-03Paper
Turán and Ramsey numbers in linear triple systems2021-01-27Paper
Distribution of colors in Gallai colorings2020-04-09Paper
Matchings with few colors in colored complete graphs and hypergraphs2020-03-20Paper
An Extension of Mantel’s Theorem to k-Graphs2020-02-25Paper
Monochromatic balanced components, matchings, and paths in multicolored complete bipartite graphs2019-11-18Paper
Partitioning the power set of \([n]\) into \(C_k\)-free parts2019-09-12Paper
Order plus size of $\tau$-critical graphs2019-08-13Paper
https://portal.mardi4nfdi.de/entity/Q53842642019-06-21Paper
A note on Ramsey numbers for Berge-\(G\) hypergraphs2019-03-25Paper
The Turán Number of Berge K_4 in Triple Systems2019-03-11Paper
Uniquely \(K_r^{(k)}\)-saturated hypergraphs2018-11-22Paper
Ramsey theory on Steiner triples2018-05-22Paper
The linear Tur\'an number of the k-fan2017-10-09Paper
Covering complete partite hypergraphs by monochromatic components2017-09-18Paper
Large monochromatic components in edge colored graphs with a minimum degree condition2017-09-08Paper
Rainbow matchings in bipartite multigraphs2017-04-25Paper
Cliques in \(C_4\)-free graphs of large minimum degree2017-04-25Paper
Induced colorful trees and paths in large chromatic graphs2017-01-18Paper
Chromatic Ramsey number of acyclic hypergraphs2016-12-22Paper
Ramsey number of a connected triangle matching2016-10-13Paper
Red-blue clique partitions and \((1-1)\)-transversals2016-09-13Paper
Vertex covers by monochromatic pieces -- a survey of results and problems2016-04-27Paper
Ramsey number of paths and connected matchings in Ore-type host graphs2016-04-08Paper
On 3-uniform hypergraphs without linear cycles2016-02-19Paper
Large Cross-Free Sets in Steiner Triple Systems2015-10-09Paper
https://portal.mardi4nfdi.de/entity/Q54999252015-08-05Paper
Replacing the host K_n by n-chromatic graphs in Ramsey-type results2015-06-15Paper
Coverings by few monochromatic pieces: a transition between two Ramsey problems2015-01-20Paper
Partitioning 2-edge-colored graphs by monochromatic paths and cycles2015-01-07Paper
List-coloring claw-free graphs with small clique number2014-09-19Paper
A note on covering edge colored hypergraphs by monochromatic components2014-09-04Paper
Monochromatic loose-cycle partitions in hypergraphs2014-09-04Paper
Domination in transitive colorings of tournaments2014-08-29Paper
Coloring 2-intersecting hypergraphs2014-08-14Paper
Noncrossing monochromatic subtrees and staircases in 0-1 matrices2014-07-04Paper
Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\)2014-06-27Paper
Rainbow matchings and cycle-free partial transversals of Latin squares2014-05-06Paper
Packing trees into \(n\)-chromatic graphs2014-04-02Paper
Multicolor Ramsey numbers for triple systems2014-02-27Paper
Complements of nearly perfect graphs2013-11-05Paper
Disconnected colors in generalized Gallai-colorings2013-10-09Paper
Problems and memories2013-07-06Paper
Ramsey and Turán-type problems in bipartite geometric graphs2013-06-28Paper
Monochromatic path and cycle partitions in hypergraphs2013-06-07Paper
Around a biclique cover conjecture2012-12-31Paper
Gallai colorings and domination in multipartite digraphs2012-11-23Paper
Partition of graphs and hypergraphs into monochromatic connected parts2012-10-24Paper
The chromatic gap and its extremes2012-10-19Paper
New bounds on the Grundy number of products of graphs2012-09-12Paper
Richard Schelp (1936-2010)2012-07-04Paper
The Ramsey number of loose triangles and quadrangles in hypergraphs2012-06-12Paper
Star versus two stripes Ramsey numbers and a conjecture of Schelp2012-05-14Paper
Monochromatic matchings in the shadow graph of almost complete hypergraphs2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q31010002011-11-22Paper
Partitioning 3-colored complete graphs into three monochromatic cycles2011-06-01Paper
On \((\delta, \chi)\)-bounded families of graphs2011-06-01Paper
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle2011-01-17Paper
Trees in greedy colorings of hypergraphs2011-01-07Paper
Large Monochromatic Components in Edge Colorings of Graphs: A Survey2010-12-20Paper
Long monochromatic Berge cycles in colored 4-uniform hypergraphs2010-11-12Paper
Ramsey-type results for Gallai colorings2010-11-10Paper
Rainbow and orthogonal paths in factorizations ofKn2010-08-03Paper
Gallai colorings of non-complete graphs2010-04-27Paper
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs2010-04-22Paper
Stability of the path-path Ramsey number2009-12-10Paper
Three-color Ramsey numbers for paths2009-07-20Paper
Large monochromatic components in colorings of complete 3-uniform hypergraphs2009-06-23Paper
Multipartite Ramsey numbers for odd cycles2009-06-16Paper
Size of monochromatic double stars in edge colorings2009-05-08Paper
The Ramsey number of diamond-matchings and loose cycles in hypergraphs2009-04-07Paper
Disjoint chorded cycles in graphs2009-01-28Paper
Corrigendum. Three-color Ramsey numbers for paths2009-01-20Paper
Inequalities for the first-fit chromatic number2008-10-08Paper
Size of monochromatic components in local edge colorings2008-05-13Paper
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs2008-03-14Paper
Highly connected monochromatic subgraphs2008-03-13Paper
Tripartite Ramsey numbers for paths2007-06-11Paper
Maximum directed cuts in acyclic digraphs2007-06-11Paper
On the Maximum Size of (p, Q)—free Families2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34339392007-04-23Paper
One-sided coverings of colored complete bipartite graphs2007-03-05Paper
Finding a monochromatic subgraph or a rainbow path2007-01-24Paper
An improved bound for the monochromatic cycle partition number2007-01-16Paper
Odd cycles and \(\Theta\)-cycles in hypergraphs2006-10-30Paper
Hall ratio of the Mycielski graphs2006-09-14Paper
Mono-multi bipartite Ramsey numbers, designs, and matrices2006-03-16Paper
Connected matchings and Hadwiger's conjecture2005-06-07Paper
Semistrong edge coloring of graphs2005-06-01Paper
Coloring the Maximal Cliques of Graphs2005-02-28Paper
Edge colorings of complete graphs without tricolored triangles2004-08-04Paper
Transitive edge coloring of graphs and dimension of lattices2003-10-14Paper
Edge list multicoloring trees: An extension of Hall's theorem2003-04-03Paper
Anti-Ramsey colorings in several rounds2002-12-10Paper
On the maximum size of \((p,Q)\)-free families2002-12-02Paper
A finite basis characterization of alpha-split colorings2002-12-02Paper
Large cliques in \(C_4\)-free graphs2002-10-20Paper
Convex sets in the plane with three of every four meeting2002-02-13Paper
Transitive tournaments and self-complementary graphs2001-11-21Paper
Decreasing the diameter of bounded degree graphs2000-12-19Paper
Vertex colorings with a distance restriction2000-11-02Paper
Split and balanced colorings of complete graphs2000-02-16Paper
Extremal problems for forbidden pairs that imply hamiltonicity1999-12-05Paper
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs1999-11-23Paper
How to decrease the diameter of triangle-free graphs1999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42430591999-09-24Paper
Nonsymmetric party problems1999-08-23Paper
A variant of the classical Ramsey problem1999-03-14Paper
2-partition-transitive tournaments1999-02-11Paper
https://portal.mardi4nfdi.de/entity/Q43932731998-12-15Paper
A communication problem and directed triple systems1998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q38382001998-08-09Paper
https://portal.mardi4nfdi.de/entity/Q38381861998-08-09Paper
The size of the largest bipartite subgraphs1998-05-13Paper
On-line 3-chromatic graphs. II: Critical graphs1998-04-15Paper
Generalized split graphs and Ramsey numbers1998-03-04Paper
A class of edge critical 4-chromatic graphs1998-02-16Paper
Fruit salad1998-02-12Paper
An edge coloring problem for graph products1997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q56890021997-03-11Paper
Graphs in which each \(C_4\) spans \(K_4\)1997-01-13Paper
https://portal.mardi4nfdi.de/entity/Q47152841996-11-12Paper
Minimal non-neighborhood-perfect graphs1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48738211996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48416601995-09-06Paper
Linear sets with five distinct differences among any four elements1995-07-04Paper
Independent Transversals in Sparse Partite Hypergraphs1994-12-07Paper
https://portal.mardi4nfdi.de/entity/Q31395281994-06-22Paper
https://portal.mardi4nfdi.de/entity/Q31371851994-06-08Paper
Rainbow coloring the cube1994-05-30Paper
Networks communicating for each pairing of terminals1993-01-17Paper
On the irregularity strength of them ×n grid1992-10-05Paper
Three-regular path pairable graphs1992-08-03Paper
Effective on-line coloring of \(P_ 5\)-free graphs1992-06-27Paper
Covering \(t\)-element sets by partitions1992-06-27Paper
The size of chordal, interval and threshold subgraphs1992-06-25Paper
Vertex coverings by monochromatic cycles and trees1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34833111990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57525901990-01-01Paper
The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963521990-01-01Paper
Induced matchings in bipartite graphs1989-01-01Paper
Domination in colored complete graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47352101988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746701988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52030621988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38047341988-01-01Paper
On a generalization of transitivity for digraphs1988-01-01Paper
An upper bound on the Ramsey number of trees1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927191987-01-01Paper
On the sum of the reciprocals of cycle lengths in sparse graphs1985-01-01Paper
On the distribution of cycle lengths in graphs1984-01-01Paper
An extremal problem for paths in bipartite graphs1984-01-01Paper
Induced subtrees in graphs of large chromatic number1980-01-01Paper

Research outcomes over time

This page was built for person: András Gyárfás