English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In 1963, Corr\'adi and Hajnal proved that for all $k\geq1$ and $n\geq3k$,every graph $G$ on $n$ vertices with minimum degree $\delta(G)\geq2k$ contains$k$ disjoint cycles. The bound $\delta(G) \geq 2k$ is sharp. Here wecharacterize those graphs with $\delta(G)\geq2k-1$ that contain $k$ disjointcycles. This answers the simple-graph case of Dirac's 1963 question on thecharacterization of $(2k-1)$-connected graphs with no $k$ disjoint cycles.  Enomoto and Wang refined the Corr\'adi-Hajnal Theorem, proving the followingOre-type version: For all $k\geq1$ and $n\geq3k$, every graph $G$ on $n$vertices contains $k$ disjoint cycles, provided that $d(x)+d(y)\geq 4k-1$ forall distinct nonadjacent vertices $x,y$. We refine this further for $k\geq3$and $n\geq3k+1$: If $G$ is a graph on $n$ vertices such that $d(x)+d(y)\geq4k-3$ for all distinct nonadjacent vertices $x,y$, then $G$ has $k$vertex-disjoint cycles if and only if the independence number $\alpha(G)\leqn-2k$ and $G$ is not one of two small exceptions in the case $k=3$. We alsoshow how the case $k=2$ follows from Lov\'asz' characterization of multigraphswith no two disjoint cycles.

On the Corr\'adi-Hajnal Theorem and a question of Dirac