11 citations · 13 across the 2 of their papers we have counts for
4 papers · 1 filter
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…
Coverings by few monochromatic pieces - a transition between two Ramsey problems
András Gyárfás, Gábor N. Sárközy, Stanley Selkow
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs…
A Practical Regularity Partitioning Algorithm and its Applications in Clustering
Gábor N. Sárközy, Fei Song, Endre Szemerédi +1
In this paper we introduce a new clustering technique called Regularity Clustering. This new technique is based on the practical variants of the two constructive versions of the Re…