András Gyárfás

András Gyárfás's AcademicInfluence.com Rankings

András Gyárfás

Mathematics

#7861

World Rank

#10671

Historical Rank

Graph Theory

#107

World Rank

#115

Historical Rank

Measure Theory

#2723

World Rank

#3252

Historical Rank

mathematics Degrees

Download Badge

Mathematics

András Gyárfás's Degrees

PhD Mathematics Eötvös Loránd University

Why Is András Gyárfás Influential?

(Suggest an Edit or Addition)

(See a Problem?)

András Gyárfás's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Problems from the world surrounding perfect graphs (1987) (360)
On-line and first fit colorings of graphs (1988) (212)
Edge colorings of complete graphs without tricolored triangles (2004) (145)
Vertex coverings by monochromatic cycles and trees (1991) (141)
Induced matchings in bipartite graphs (1989) (122)
The maximum number of edges in 2K2-free graphs of bounded degree (1990) (112)
On the chromatic number of multiple interval graphs and overlap graphs (1985) (98)
Three-Color Ramsey Numbers For Paths (2007) (93)
Covering and coloring problems for relatives of intervals (1985) (93)
THE STRONG CHROMATIC INDEX OF GRAPHS (1990) (88)
An improved bound for the monochromatic cycle partition number (2006) (87)
Induced subtrees in graphs of large chromatic number (1980) (81)
Coloring the Maximal Cliques of Graphs (2004) (77)
A variant of the classical Ramsey problem (1997) (76)
Ramsey‐type results for Gallai colorings (2010) (66)
A Ramsey-type problem in directed and bipartite graphs (1973) (64)
Vertex coverings by monochromatic paths and cycles (1983) (64)
On graphs with strongly independent color‐classes (2004) (54)
On the irregularity strength of the m × n grid (1992) (50)
Ramsey numbers for local colorings (1987) (49)
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles (2011) (46)
Covering Complete Graphs by Monochromatic Paths (1989) (46)
Three-color Ramsey numbers for paths (2008) (45)
Large Monochromatic Components in Edge Colorings of Graphs: A Survey (2011) (43)
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (2008) (43)
Convex Sets in the Plane with Three of Every Four Meeting (2001) (42)
Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (38)
Gallai colorings of non-complete graphs (2010) (38)
Decreasing the diameter of bounded degree graphs (2000) (37)
The irregularity strength of Km, m is 4 for odd m (1988) (37)
The size of the largest bipartite subgraphs (1997) (37)
Graphs with k odd cycle lengths (1992) (36)
Tripartite Ramsey numbers for paths (2007) (36)
Maximum directed cuts in acyclic digraphs (2007) (36)
Star Versus Two Stripes Ramsey Numbers and a Conjecture of Schelp (2012) (35)
Local k-colorings of graphs and hypergraphs (1987) (34)
On the distribution of cycle lengths in graphs (1984) (33)
Highly connected monochromatic subgraphs (2008) (33)
An extremal problem for paths in bipartite graphs (1984) (33)
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs (2008) (32)
Vertex covers by monochromatic pieces - A survey of results and problems (2015) (31)
Rainbow matchings in bipartite multigraphs (2015) (30)
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs (2012) (28)
Networks communicating for each pairing of terminals (1992) (28)
Monochromatic Path and Cycle Partitions in Hypergraphs (2013) (25)
Disjoint chorded cycles in graphs (2008) (25)
A simple lower bound on edge coverings by cliques (1990) (25)
How to decrease the diameter of triangle-free graphs (1998) (24)
Multicolor Ramsey numbers for triple systems (2013) (22)
Hall ratio of the Mycielski graphs (2006) (22)
The chromatic gap and its extremes (2011) (22)
Covering t-element Sets by Partitions (1991) (21)
Hypergraph families with bounded edge cover or transversal number (1983) (20)
A note on Ramsey numbers for Berge-G hypergraphs (2018) (20)
Minimal path-pairable graphs (1992) (20)
Domination in colored complete graphs (1989) (20)
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (2010) (20)
Ramsey-type results for Gallai colorings (2010) (20)
On graphs with strongly independent color-classes (2004) (20)
Rainbow and orthogonal paths in factorizations of Kn (2010) (19)
Effective on-line coloring ofP5-free graphs (1991) (19)
On-line 3-chromatic graphs - II critical graphs (1997) (19)
Path pairable graphs (1999) (18)
Split and balanced colorings of complete graphs (1999) (17)
One-sided Coverings of Colored Complete Bipartite Graphs (2006) (17)
Rainbow matchings and cycle-free partial transversals of Latin squares (2014) (17)
Size of Monochromatic Double Stars in Edge Colorings (2008) (17)
Upper bound on the order of τ-critical hypergraphs (1982) (17)
Domination in transitive colorings of tournaments (2013) (17)
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs (2010) (15)
Long rainbow cycles in proper edge-colorings of complete graphs (2011) (15)
Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs (2010) (15)
Fruit Salad (1997) (15)
Generalized Split Graphs and Ramsey Numbers (1998) (15)
Connected matchings and Hadwiger's conjecture (2005) (15)
Finding a monochromatic subgraph or a rainbow path (2007) (15)
Semistrong edge coloring of graphs (2005) (14)
Monochromatic Loose-cycle Partitions in Hypergraphs (2014) (14)
Stability of the path-path Ramsey number (2009) (14)
Three-regular path pairable graphs (1992) (13)
Cycles in graphs without proper subgraphs of minimum degree 3 (13)
On the rotation distance of graphs (1994) (13)
2-Partition-Transitive Tournaments (1998) (13)
Reflections on a Problem of Erdős and Hajnal (2013) (13)
An Extension of Mantel’s Theorem to k-Graphs (2020) (13)
Around a biclique cover conjecture (2012) (13)
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems (2013) (13)
Large Monochromatic Components in Edge Colored Graphs with a Minimum Degree Condition (2017) (12)
Vertex colorings with a distance restriction (1998) (12)
Edge list multicoloring trees: An extension of Hall's theorem (2003) (12)
Size of monochromatic components in local edge colorings (2008) (11)
Anti-Ramsey Colorings in Several Rounds (2001) (11)
Monochromatic Hamiltonian 3‐tight Berge cycles in 2‐colored 4‐uniform hypergraphs (2010) (11)
Gallai colorings and domination in multipartite digraphs (2010) (11)
Large Cliques in -Free Graphs (2002) (11)
Rainbow coloring the cube (1993) (10)
Inequalities for the first‐fit chromatic number (2008) (10)
Large monochromatic components in colorings of complete 3-uniform hypergraphs (2009) (10)
Complements of nearly perfect graphs (2013) (9)
Irregularity strength of uniform hypergraphs (1992) (9)
Mono-multi bipartite Ramsey numbers, designs, and matrices (2006) (9)
Disconnected Colors in Generalized Gallai‐Colorings (2013) (9)
Independent Transversals in Sparse Partite Hypergraphs (1994) (9)
The Turán Number of Berge K_4 in Triple Systems (2018) (8)
New Bounds on the Grundy Number of Products of Graphs (2012) (8)
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts (2012) (8)
Induced Colorful Trees and Paths in Large Chromatic Graphs (2016) (8)
Replacing the host K_n by n-chromatic graphs in Ramsey-type results (2015) (7)
Inequalities for the first-fit chromatic number (2008) (7)
Multipartite Ramsey numbers for odd cycles (2009) (7)
The size of chordal, interval and threshold subgraphs (1989) (7)
A Class of Edge Critical 4-Chromatic Graphs (1997) (6)
Turán and Ramsey numbers in linear triple systems (2020) (6)
An upper bound on the Ramsey number of trees (1987) (6)
A Ramsey-type theorem and its application to relatives of Helly's theorem (1973) (6)
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs (2010) (6)
Packing Trees Into n-Chromatic Graphs (2014) (6)
Rainbow matchings and partial transversals of Latin squares (2012) (6)
Clumsy packing of dominoes (1988) (6)
Linear Turán numbers of acyclic triple systems (2022) (6)
Distribution of colors in Gallai colorings (2019) (6)
A Communication Problem and Directed Triple Systems (1998) (6)
Partitioning edge-2-colored graphs by monochromatic paths and cycles (2012) (6)
Problems and memories (2013) (5)
Minimal non-neighborhood-perfect graphs (1996) (5)
Ramsey and Turán-type problems for non-crossing subgraphs of bipartite geometric graphs (2011) (5)
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components (2014) (5)
Trees in greedy colorings of hypergraphs (2011) (5)
On a Ramsey type problem of Shelah (1994) (5)
Linear Sets with Five Distinct Differences among Any Four Elements (1995) (5)
Vertex covering with monochromatic paths (1995) (5)
Odd cycles and Theta-cycles in hypergraphs (2006) (5)
Transitive Edge Coloring of Graphs and Dimension of Lattices (2002) (4)
Gallai-Colorings of Triples and 2-Factors of (2013) (4)
On a generalization of transitivity for digraphs (1988) (4)
Large Cross‐Free Sets in Steiner Triple Systems (2015) (4)
List-Coloring Claw-Free Graphs with Small Clique Number (2014) (4)
Chromatic Ramsey number of acyclic hypergraphs (2015) (3)
Transitive tournaments and self-complementary graphs (2001) (3)
Still another triangle-free infinite-chromatic graph (1980) (3)
On the sum of the reciprocals of cycle lengths in sparse graphs (1985) (3)
Order plus size of τ ‐critical graphs (2020) (3)
On the Maximum Size of (p, Q) - free Families (2001) (3)
Ramsey theory on Steiner triples (2018) (3)
Ramsey Number of a Connected Triangle Matching (2015) (3)
A finite basis characterization of ?-split colorings (2002) (3)
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs (1999) (3)
How many atoms can be defined by boxes? (1985) (3)
Ramsey and Turán-type problems in bipartite geometric graphs (2008) (2)
Endpoint extendable paths in tournaments (1996) (2)
Noncrossing Monochromatic Subtrees and Staircases in 0-1 Matrices (2014) (2)
Large Sets of t-designs and a Ramsey-type Problem (2018) (2)
On (δ, χ)-Bounded Families of Graphs (2011) (2)
Transitive tournaments and self‐complementary graphs (2001) (2)
The structure of rectangle families dividing the plane into maximum number of atoms (1984) (2)
Matchings with few colors in colored complete graphs and hypergraphs (2020) (2)
Red-Blue Clique Partitions and (1-1)-Transversals (2015) (2)
The linear Turán number of small triple systems or why is the wicket interesting? (2022) (2)
Ramsey number of paths and connected matchings in Ore-type host graphs (2016) (2)
COMBINATORICS OF INTERVALS PRELIMINARY VERSION (2003) (2)
Extremal problems for forbidden pairs that imply hamiltonicity (1999) (2)
Graphs in which each C4 spans K4 (1996) (1)
Covering complete partite hypergraphs by monochromatic components (2016) (1)
Ramsey numbers of path-matchings, covering designs, and 1-cores (2019) (1)
Extremal Problems for Degree Sequences (2004) (1)
On Graphs Of Irregularity Strength 2 (2011) (1)
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems (2013) (1)
Partitioning 2-edge-colored graphs by monochromatic paths and cycles (2014) (1)
Cliques in $$C_4$$C4-free graphs of large minimum degree (2015) (1)
A note on hypergraphs with the Helly-property (1978) (1)
Uniquely Kr(k)-Saturated Hypergraphs (2018) (0)
List-Coloring Claw-Free Graphs with Small Clique Number (2012) (0)
North-Holland ON A GENERALIZATION OF TRANSITIVITY FOR DIGRAPHS (2011) (0)
A Collection of MTA-ELTE GAC manuscripts (2016) (0)
Crowns in Linear $3$-Graphs of Minimum Degree $4$ (2022) (0)
Coloring 2-Intersecting Hypergraphs (2013) (0)
Graph Theory (1999) (0)
Perfect matchings in shadow colorings (2020) (0)
Un co rre cte d Pr oo f Large Monochromatic Components in Edge 1 Colorings of Graphs : A Survey 2 (2010) (0)
CPC volume 3 issue 3 Cover and Back matter (1994) (0)
C O ] 2 S ep 2 01 5 Chromatic Ramsey number of acyclic hypergraphs (2018) (0)
Perfect matchings in shadow colorings (2020) (0)
On the maximum size of (p, Q)-free families (2002) (0)
Order plus size of $\tau$-critical graphs. (2019) (0)
Problems close to my heart (2023) (0)
C O ] 1 4 A ug 2 01 8 Monochromatic balanced components , matchings , and paths in multicolored complete bipartite graphs (2018) (0)
" Offprints from Graph Theory , Combinatorics , and Applications (2011) (0)
Paths and cycles with many colors in edge-colored complete graphs ∗ (2008) (0)
Richard Schelp (1936-2010) (2012) (0)
Minimal non-neighbourhood perfect graphs (1996) (0)
Blocking the Loops of a Flow‐Graph (1976) (0)
Rainbow matchings in bipartite multigraphs (2016) (0)
An edge coloring problem for graph products (1996) (0)
Monochromatic even cycles (2012) (0)

This paper list is powered by the following services:

András Gyárfás's Academic­Influence.com Rankings

András Gyárfás's Degrees

Why Is András Gyárfás Influential?

András Gyárfás's Published Works

Published Works

András Gyárfás's AcademicInfluence.com Rankings