2-reachable subsets in two-colored graphs

Andras Gyarfas, Gabor N. Sarkozy

A subset $X$ of vertices in a graph $G$ is a {\em diameter 2 subset} if the distance of any two vertices of $X$ is at most two {\em in $G[X]$}. Relaxing this notion, a subset $X$ o…