35 citations · 136 across the 22 of their papers we have counts for
9 papers · 1 filter
Cliques in C_4-free graphs of large minimum degree
A. Gyarfas, G. N. Sarkozy
A graph is called -free if it does not contain the cycle as an induced subgraph. Hubenko, Solymosi and the first author proved (answering a question of Erd\H os) a p…
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
Jozsef Balogh, Janos Barat, Daniel Gerbner +2
We present results on partitioning the vertices of -edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárköz…
Vertex covers by monochromatic pieces - A survey of results and problems
Andras Gyarfas
This survey is devoted to problems and results concerning covering the vertices of edge colored graphs or hypergraphs with monochromatic paths, cycles and other objects. It is an e…
Ramsey number of a connected triangle matching
Andras Gyarfas, Gabor N. Sarkozy
We determine the -color Ramsey number of a {\em connected} triangle matching which is any connected graph containing vertex disjoint triangles. We obtain that $R(c…
Large Cross-free sets in Steiner triple systems
Andras Gyarfas
A {\em cross-free} set of size in a Steiner triple system is three pairwise disjoint -element subsets such that no in…
Red-blue clique partitions and (1-1)-transversals
Andras Gyarfas, Jeno Lehel
Motivated by the problem of Gallai on -transversals of -intervals, it was proved by the authors in 1969 that if the edges of a complete graph are colored with red and…