35 citations · 56 across the 9 of their papers we have counts for
11 papers
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…
Large monochromatic components in multicolored bipartite graphs
Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy
It is well-known that in every -coloring of the edges of the complete bipartite graph there is a monochromatic connected component with at least vertice…
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…
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…
Rainbow matchings in bipartite multigraphs
János Barát, András Gyárfás, Gábor N. Sárközy
Suppose that is a non-negative integer and a bipartite multigraph is the union of matchings , each of…