Ore-type conditions for bipartite graphs containing hexagons (Q2275389): Difference between revisions

Let \(G=(V_{1},V_{2};E)\) be a bipartite graph with partitioning sets \( V_{1},V_{2}\) such that \(|V_{1}|=|V_{2}|\). It is defined that \[ \delta _{1,1}(G)=\min \{d(x)+d(y)|x\in V_{1},y\in V_{2},x\neq y,xy\notin E(G)\}. \] In this paper, the authors consider ore-type conditions that ensure \(G\) contains hexagons. In fact, after a sequence of lemmas, the authors proved the following results: Let \(G=(V_{1},V_{2};E)\) be a bipartite graph with \( |V_{1}|=|V_{2}|=3k\). Then {\parindent=7mm \begin{itemize}\item[(1)]for a positive integer \(k\), if \(\delta _{1,1}(G)\geq 4k-1\), then \(G\) contains \(k-1\) independent hexagons and a \(6\) -path such that all of them are independent. \item[(2)]for an integer \(k>2\), if \( \delta _{1,1}(G)\geq 4k\), then \(G\) contains \(k-2\) independent hexagons and a \(12\)-cycle such that all of them are independent. \end{itemize}}