二染色完全二部图的有界直径覆盖
Bounded diameter covering of 2-colored complete bipartite graphs
AI总结：
针对二染色完全二部图的覆盖问题，在Henderson-Ryser猜想的有界直径二部类似问题基础上，将其顶点覆盖的单色子图直径上界从4改进为最优值3。
AI中文摘要：
与Henderson-Ryser猜想的有界直径二部类似问题相关，DeBiasio、Kamel、McCourt和Sheats证明了每个二染色完全二部图的顶点都可被两个单色子图覆盖，每个子图直径至多为4。我们将该直径上界改进为最优值3。
英文摘要：
Related to a bounded-diameter bipartite analogue of the Henderson--Ryser conjecture, DeBiasio, Kamel, McCourt, and Sheats proved that the vertices of every $2$-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}.
