# An Ore-type condition for existence of two disjoint cycles

## TL;DR

This paper improves a degree sum condition for guaranteeing two disjoint cycles of specified lengths in a graph, extending previous results and confirming a conjecture about the minimal degree sum needed.

## Contribution

It establishes that a degree sum condition of at least n+2 suffices for the existence of two disjoint cycles of given lengths, generalizing prior theorems.

## Key findings

- Improves the degree sum condition to d(u)+d(v) ≥ n+2
- Confirms the conjecture posed by Yan et al.
- Generalizes El-Zahar's result for odd n1 and n2.

## Abstract

Let $n_{1}$ and $n_{2}$ be two integers with $n_{1},n_{2}\geq3$ and $G$ a graph of order $n=n_{1}+n_{2}$. As a generalization of Ore's degree condition for the existence of Hamilton cycle in $G$, El-Zahar proved that if $\delta(G)\geq \left\lceil\frac{n_{1}}{2}\right\rceil+\left\lceil\frac{n_{2}}{2}\right\rceil$ then $G$ contains two disjoint cycles of length $n_{1}$ and $n_{2}$. Recently, Yan et. al considered the problem by extending the degree condition to degree sum condition and proved that if $d(u)+d(v)\geq n+4$ for any pair of non-adjacent vertices $u$ and $v$ of $G$, then $G$ contains two disjoint cycles of length $n_{1}$ and $n_{2}$. They further asked whether the degree sum condition can be improved to $d(u)+d(v)\geq n+2$. In this paper, we give a positive answer to this question. Our result also generalizes El-Zahar's result when $n_{1}$ and $n_{2}$ are both odd.