8 citations · 8 across the 2 of their papers we have counts for
2 papers
math.CO2025
2-reachable subsets in two-colored graphs
Andras Gyarfas, Gabor N. Sarkozy
A subset of vertices in a graph is a {\em diameter 2 subset} if the distance of any two vertices of is at most two {\em in }. Relaxing this notion, a subset o…
math.CO2016★ 8 cited
Ramsey numbers for bipartite graphs with small bandwidth
Guilherme O. Mota, Gábor N. Sárközy, Mathias Schacht +1
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers fo…