| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | András Gyárfás, Jenö Lehel |
Trees in greedy colorings of hypergraphs.  |
Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Manouchehr Zaker |
On (δ, χ)-Bounded Families of Graphs. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Partitioning 3-Colored Complete Graphs into Three Monochromatic Cycles. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy |
The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy |
Gallai colorings of non-complete graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs. |
Graphs and Combinatorics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow |
Ramsey-type results for Gallai colorings. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
Stability of the path-path Ramsey number. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Penny E. Haxell |
Large monochromatic components in colorings of complete 3-uniform hypergraphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Richard H. Schelp |
Multipartite Ramsey numbers for odd cycles. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp |
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
Ramsey and Turán-type problems in bipartite geometric graphs. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, András Gyárfás |
Highly connected monochromatic subgraphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Bialostocki, Daniel Finkel, András Gyárfás |
Disjoint chorded cycles in graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy |
Size of monochromatic components in local edge colorings. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy, Endre Szemerédi |
The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs. |
Electr. J. Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | András Gyárfás, Gábor N. Sárközy |
Size of Monochromatic Double Stars in Edge Colorings. |
Graphs and Combinatorics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Three-color Ramsey numbers for paths. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C55, 05C38 |
| 1 | Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow |
Inequalities for the first-fit chromatic number. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Three-Color Ramsey Numbers For Paths. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C55, 05C38 |
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
Tripartite Ramsey numbers for paths. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Richard H. Schelp |
Finding a monochromatic subgraph or a rainbow path. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott |
Maximum directed cuts in acyclic digraphs. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi |
An improved bound for the monochromatic cycle partition number. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp |
Mono-multi bipartite Ramsey numbers, designs, and matrices. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathew Cropper, András Gyárfás, Jenö Lehel |
Hall ratio of the Mycielski graphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel |
Odd cycles and Theta-cycles in hypergraphs. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, András Gyárfás, Gábor Simonyi |
Connected matchings and Hadwiger's conjecture. |
Combinatorics, Probability & Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Alice Hubenko |
Semistrong edge coloring of graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Bacsó, Sylvain Gravier, András Gyárfás, Myriam Preissmann, András Sebö |
Coloring the Maximal Cliques of Graphs. |
SIAM J. Discrete Math. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Gábor Simonyi |
Edge colorings of complete graphs without tricolored triangles. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, T. Jensen, Michael Stiebitz |
On graphs with strongly independent color-classes. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, András Gyárfás, Miklós Ruszinkó |
On the maximum size of (p, Q)-free families. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, André E. Kézdy, Jenö Lehel |
A finite basis characterization of ?-split colorings. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Alice Hubenko, József Solymosi |
Large Cliques in C4-Free Graphs. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C35 |
| 1 | András Gyárfás |
Transitive Edge Coloring of Graphs and Dimension of Lattices. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) 05C15 |
| 1 | Aart Blokhuis, Ralph J. Faudree, András Gyárfás, Miklós Ruszinkó |
Anti-Ramsey Colorings in Several Rounds. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Füredi, András Gyárfás, Miklós Ruszinkó |
On the Maximum Size of (p, Q) - free Families. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel J. Kleitman, András Gyárfás, Géza Tóth |
Convex Sets in the Plane with Three of Every Four Meeting. |
Combinatorica |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 52A35 |
| 1 | Paul Erdös, András Gyárfás |
Split and balanced colorings of complete graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Zoltán Király, Jenö Lehel |
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. |
SIAM J. Discrete Math. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
Generalized Split Graphs and Ramsey Numbers. |
J. Comb. Theory, Ser. A |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl |
2-Partition-Transitive Tournaments. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, András Gyárfás, Richard H. Schelp |
Vertex colorings with a distance restriction. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Miklós Ruszinkó |
How to decrease the diameter of triangle-free graphs. |
Combinatorica |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C12, 05C35 |
| 1 | András Gyárfás, Richard H. Schelp |
A Communication Problem and Directed Triple Systems. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Zoltán Király, Jenö Lehel |
On-line 3-chromatic graphs - II critical graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa |
The size of the largest bipartite subgraphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
Fruit Salad. |
Electr. J. Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás |
A Variant of the Classical Ramsey Problem. |
Combinatorica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Tomasz Luczak |
Graphs in which each C4 spans K4. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel |
Linear Sets with Five Distinct Differences among Any Four Elements. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel |
On the rotation distance of graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Tomasz Luczak |
Independet Transversals in Sparse Partite Hypergraphs. |
Combinatorics, Probability & Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
Graphs with k odd cycle lengths. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, András Gyárfás, Jenö Lehel |
Three-regular path pairable graphs. |
Graphs and Combinatorics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, László Pyber |
Vertex coverings by monochromatic cycles and trees. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel |
Effective on-line coloring of P5-free graphs. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter |
The maximum number of edges in 2K2-free graphs of bounded degree. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
A simple lower bound on edge coverings by cliques. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, András Gyárfás, Richard H. Schelp, Zsolt Tuza |
Induced matchings in bipartite graphs. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein |
The size of chordal, interval and threshold subgraphs. |
Combinatorica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
The irregularity strength of Km, m is 4 for odd m. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Zsolt Tuza |
Clumsy packing of dominoes. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Michael S. Jacobson, Lael F. Kinch |
On a generalization of transitivity for digraphs. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza |
Local k-colorings of graphs and hypergraphs. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Zsolt Tuza |
An upper bound on the Ramsey number of trees. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza |
Ramsey numbers for local colorings. |
Graphs and Combinatorics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
Corrigendum. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel |
Covering and coloring problems for relatives of intervals. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás |
On the chromatic number of multiple interval graphs and overlap graphs. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Hans Jürgen Prömel, Endre Szemerédi, Bernd Voigt |
On the sum of the reciprocals of cycle lengths in sparse graphs. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Zsolt Tuza |
How many atoms can be defined by boxes. |
Combinatorica |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel, Zsolt Tuza |
The structure of rectangle families dividing the plane into maximum number of atoms. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | András Gyárfás, Jenö Lehel |
Hypergraph families with bounded edge cover or transversal number. |
Combinatorica |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")