Maximal total length of \(k\) disjoint cycles in bitpartite graphs (Q2387188): Difference between revisions

Let \(k\), \(s\) and \(n\) be three integers with \(s\geq k\geq 2\), \(n\geq 2k+1\). Let \(G=(V_1,V_2;E)\) be a bipartite graph with \(| V_1| =| V_2| =n\). In the paper it is proved that if the minimum degree of \(G\) is at least \(s+1\), then \(G\) contains \(k\) vertex-disjoint cycles covering at least \(\min(2n,4s)\) vertices of \(G\).