Monochromatic components in dense 2-edge-coloured balanced bipartite graphs

Abstract: We prove that each $2$-edge-coloured spanning subgraph $G$ of $K_{n,n}$ with $δ(G)\ge \lfloor (2n+1)/3 \rfloor$ can be covered by at most three monochromatic components. We provide a $2$-edge-coloured spanning subgraph of $K_{n,n}$ showing this minimum degree condition is sharp.

• The paper proves that every red–blue spanning subgraph of K_{n,n} with minimum degree at least floor((2n+1)/3) has its vertices covered by three monochromatic connected components.
• It develops structural stopping criteria and an extremal analysis of dominant-colour components to establish the upper bound for every n ≥ 2, without asymptotic assumptions.
• A matching construction with minimum degree floor((2n+1)/3) − 1 requires at least four components, proving the threshold is exact across all residue classes of n modulo 3.

The problem and the main result

This paper determines, exactly, the minimum-degree threshold that forces a 2-edge-coloured spanning subgraph of $K_{n,n}$ to admit a vertex cover by three monochromatic connected components. Writing $_2(G)$ for the least $k$ such that every red–blue colouring of $E(G)$ covers $V(G)$ with at most $k$ monochromatic components, the authors prove the following sharp result (2608.17300).

Theorem. For every integer $n \geq 2$, if $G$ is a spanning subgraph of $K_{n,n}$ with $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$, then $_2(G)$0. Moreover, there exists such a graph $_2(G)$1 with $_2(G)$2 and $_2(G)$3.

The result is best possible in the strongest sense: the threshold holds for all $_2(G)$4 (no asymptotic or "sufficiently large" qualifier), and the lower-bound construction matches it exactly for every residue class of $_2(G)$5 modulo 3.

Context: covers versus partitions and prior thresholds

Covering vertices by monochromatic components is a classical Ramsey-theoretic question. Erdős, Gyárfás, and Pyber conjectured that every $_2(G)$6-edge-colouring of $_2(G)$7 can be covered by at most $_2(G)$8 monochromatic components, while the bipartite analogue attributed to Gyárfás and Lehel asserts that every $_2(G)$9-edge-colouring of $k$0 can be covered by at most $k$1 components; this is closely tied to Ryser-type covering conjectures for hypergraphs (Chen et al., 2012). In the minimum-degree regime, Girão, Letzter, and Sahasrabudhe showed that every sufficiently large $k$2-vertex graph with $k$3 satisfies $k$4 [girao2019partitioning]. For bipartite host graphs, Fernández, Pavez-Signé, and Stein had previously established only that $k$5 suffices for $k$6, valid for large $k$7 [fernandez2024monochromatic].

A natural question is whether two components suffice under some nontrivial minimum degree. The answer is essentially no: deleting from $k$8 the two edges $k$9 and $E(G)$0 and colouring appropriately yields a graph with $E(G)$1 and $E(G)$2, so any degree condition forcing $E(G)$3 must require minimum degree at least $E(G)$4. Even random bipartite graphs of density up to $E(G)$5 cannot, with high probability, be covered by two monochromatic components [fernandez2024monochromatic]. Three components is therefore the correct target, and this paper pins down its exact threshold as $E(G)$6, improving the previous bound of roughly $E(G)$7 and removing both the additive error term and the large-$E(G)$8 restriction.

The sharpness construction

The lower-bound construction partitions each side into three parts plus special vertices: $E(G)$9 and $V(G)$0, with $V(G)$1 and $V(G)$2 taking the remainder. Edges are present only between cyclically offset pairs ($V(G)$3 to $V(G)$4, indices mod 3), with colouring rules designed so that the four special vertices $V(G)$5 lie in pairwise distinct components in each colour. A direct computation gives $V(G)$6, where $V(G)$7 and $V(G)$8. Since no monochromatic component contains two special vertices, every cover uses at least four components. This confirms that the threshold $V(G)$9 cannot be lowered by even one.

Proof architecture for the upper bound

Write $k$0. The proof proceeds by reductions built around three structural facts:

• Fact (auxiliary). If every pair of vertices in $k$1 is joined by a monochromatic path, then $k$2 lies in one monochromatic component — via the standard fact that every 2-edge-coloured complete graph has a monochromatic spanning tree.
• Proposition (covering one side). If $k$3 and at most two monochromatic components cover $k$4 or cover $k$5, then $k$6: leftover vertices on the other side share common neighbours and coalesce into a single third component.
• Stopping criteria. Under $k$7, a cover by three components exists whenever (i) some monochromatic component covers at least $k$8 vertices on one side, or (ii) at most three same-coloured components cover one side. The proof of (i) is the most delicate part, involving a pair $k$9 in distinct blue components with no common neighbour of either colour; counting arguments force $n \geq 2$0, and the extremal equality cases are resolved using the exact arithmetic of $n \geq 2$1 across residues modulo 3.

The main argument then classifies vertices of $n \geq 2$2 by dominant colour. Since three distinct red components containing red-dominant vertices would have footprints on $n \geq 2$3 totalling at least $n \geq 2$4, one may select at most two red components $n \geq 2$5 covering all red-dominant vertices of $n \geq 2$6, and symmetrically at most two blue components $n \geq 2$7. These four components form a skeleton; the analysis tracks the "red-only" sets $n \geq 2$8, "blue-only" sets $n \geq 2$9, and the uncovered set $G$0.

Part 1 handles the case where one colour needs only one component. A sandwich inequality $G$1 is derived; since $G$2 equals $G$3, $G$4, or $G$5 according as $G$6, the case $G$7 gives an outright contradiction, while the extremal cases force either $G$8 into a single blue component or three red components covering $G$9 — both stopping criteria.

Part 2, where both colours need two components, is reduced through three claims to a rigid "crossed" configuration: $K_{n,n}$0 lies only in $K_{n,n}$1 while $K_{n,n}$2 lies only in $K_{n,n}$3, and analogously for blue, with $K_{n,n}$4. The claims show successively that none of the four exclusive sets may be empty, that no exclusive set may straddle both selected components of its colour, and that exclusive sets must occupy opposite selected components. In the final configuration, choosing pairs $K_{n,n}$5 with disjoint blue neighbourhoods and $K_{n,n}$6 with disjoint red neighbourhoods, and combining their degree inequalities with the $K_{n,n}$7 footprints of dominant vertices in $K_{n,n}$8 and $K_{n,n}$9, yields $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$0 or $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$1 — either of which forces $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$2 or $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$3, contradicting the crossed structure. Hence some stopping criterion always applies, proving $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$4.

Significance and limitations

The theorem is exact in all parameters: it holds for every $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$5, and the matching construction shows no improvement is possible. It also settles the question left open by [fernandez2024monochromatic], whose $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$6 threshold was far from tight. Two caveats are worth noting. First, the result concerns covers by monochromatic components, not partitions into disjoint ones; the partition variant studied by Benevides, Quintino, and Talon [benevides2024partitioning] permits up to four monochromatic cycles for all of $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$7, and the relationship between optimal covers and partitions under minimum-degree constraints remains unaddressed here. Second, the paper treats only $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$8 colours; the corresponding threshold for $\delta(G)\ge \lfloor (2n+1)/3 \rfloor$9 colours on balanced bipartite hosts — where the Gyárfás–Lehel bound suggests $_2(G)$00 components may be needed — is not considered, nor is the analogous question for unbalanced bipartite graphs, where the interplay between the two side sizes could alter the correct threshold.

Conclusion

This paper establishes the exact minimum-degree threshold $_2(G)$01 guaranteeing that every 2-edge-coloured spanning subgraph of $_2(G)$02 can be covered by three monochromatic components, with a matching construction showing sharpness for all $_2(G)$03. The proof combines clean stopping criteria with a detailed extremal analysis of a forced crossed configuration, resolving residue-class subtleties exactly. The result closes the gap between the general-graph threshold of $_2(G)$04 for two-component covers and the bipartite setting, where two components provably fail except at near-complete density.