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

César Bispo, George Kontogeorgiou, Marcelo Lage +2

We prove that each $2$-edge-coloured spanning subgraph $G$ of $K_{n,n}$ with $\delta (G)\ge \lfloor (2n+1)/3\rfloor$ can be covered by at most three monochromatic components. We provide…