2-reachable subsets in two-colored graphs

TL;DR

This paper proves a relaxed version of a conjecture about covering vertices in 2-colored cocktail party graphs with two monochromatic 2-reachable subsets, establishing a lower bound on the size of such subsets.

Contribution

It introduces the concept of 2-reachable subsets and proves the conjecture's relaxed form, extending understanding of monochromatic structures in 2-colored graphs.

Findings

Every 2-colored cocktail party graph contains a monochromatic 2-reachable subset with at least half the vertices.

The result is tight; the bound cannot be improved.

The paper confirms the relaxed conjecture related to graph colorings and diameter properties.

Abstract

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$ of vertices in a graph $G$ is a {\em 2-reachable subset} if the distance of any two vertices of $X$ is at most two {\em in $G$}. Related to recent attempts to strengthen a well-known conjecture of Ryser, English et al. conjectured that the vertices of a $2$-edge-colored cocktail party graph (the graph obtained from a complete graph with an even number of vertices by deleting a perfect matching) can be covered by the vertices of two monochromatic diameter $2$ subsets. In this note we prove the relaxed form of this conjecture, replacing diameter $2$ by $2$-reachable. An immediate corollary is that $2$-colored cocktail party graphs on $n$ vertices must contain a monochromatic $2$-reachable subset with at least $n\over 2$ vertices (and this is best possible).