Bounded diameter covering of 2-colored complete bipartite graphs
arXiv:2608.25081
Abstract
Related to a bounded-diameter bipartite analogue of the Henderson--Ryser conjecture, DeBiasio, Kamel, McCourt, and Sheats proved that the vertices of every -colored complete bipartite graph can be covered by two monochromatic subgraphs, each of diameter at most four. We improve this bound on the diameter to the best possible value of {\em three}.
12 pages, 1 figure