35 citations · 136 across the 22 of their papers we have counts for
28 papers
Proper edge colorings of planar graphs with rainbow -s
András Gyárfás, Ryan R. Martin, Miklós Ruszinkó +1
We call a proper edge coloring of a graph a B-coloring if every 4-cycle of is colored with four different colors. Let denote the smallest number of colors needed f…
Monochromatic spanning trees and matchings in ordered complete graphs
János Barát, András Gyárfás, Géza Tóth
Two independent edges in ordered graphs can be nested, crossing or separated. These relations define six types of subgraphs, depending on which relations are forbidden. We refine a…
Turan and Ramsey numbers in linear triple systems
Andras Gyarfas, Gabor N. Sarkozy
In this paper we study Turán and Ramsey numbers in linear triple systems, defined as -uniform hypergraphs in which any two triples intersect in at most one vertex. A famous resu…
Ramsey numbers of path-matchings, covering designs and 1-cores
Louis DeBiasio, András Gyárfás, Gábor N. Sárközy
A path-matching of order is a vertex disjoint union of nontrivial paths spanning vertices. Burr and Roberts, and Faudree and Schelp determined the 2-color Ramsey number of…
Order plus size of -critical graphs
Andras Gyarfas, Lehel Jeno
Let be a -critical graph with . Erdős and Gallai proved that and the bound was obtained by Erdős, Hajnal and Moon. We giv…
Distribution of colors in Gallai colorings
András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós +1
A Gallai coloring is an edge coloring that avoids triangles colored with three different colors. Given integers with …