On the maximum number of independent cycles in a bipartite graph (Q1924141)

In [\textit{K. Corrádi} and \textit{A. Hajnal}, On the maximum number of independent circuits in a graph, Acta Math. Acad. Sci. Hung. 14, 423-439 (1963; Zbl 0118.19001)] it was shown that if \(G\) is a graph of order at least \(3k\) with minimum degree at least \(2k\), then \(G\) contains \(k\) independent cycles. A collection of cycles in a graph is called independent if they are vertex disjoint. Here the author considers the analogous bipartite problem. Theorem 1. Let \(G\) be a bipartite graph with partite sets \(V_1\) and \(V_2\). If \(|V_1|=|V_2|=n>2k\) and \(G\) has minimum degree at least \(k+1\), then \(G\) contains \(k\) independent cycles.