11 citations · 13 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 2 cited
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…
math.CO2012★ 11 cited
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…