On edge colorings with at least q colors in every subset of p vertices. Sárközy, Gábor N.; Selkow, Stanley — 2001 The Electronic Journal of Combinatorics [electronic only]
On cycles in the coprime graph of integers. Erdős, Paul; Sarkozy, Gabor N. — 1997 The Electronic Journal of Combinatorics [electronic only]
The Ramsey number of diamond-matchings and loose cycles in hypergraphs. Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre — 2008 The Electronic Journal of Combinatorics [electronic only]
Partitioning 3-colored complete graphs into three monochromatic cycles. Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre — 2011 The Electronic Journal of Combinatorics [electronic only]