Monochromatic components in dense 2-edge-coloured balanced bipartite graphs
César Bispo, George Kontogeorgiou, Marcelo Lage, Guilherme O. Mota, Bruno Skarmeta
Abstract
We prove that each 2-edge-coloured spanning subgraph G of Kn,n with δ(G) (2n+1)/3 can be covered by at most three monochromatic components. We provide a 2-edge-coloured spanning subgraph of Kn,n showing this minimum degree condition is sharp.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato