An Ore-type Condition for Large $k$-factor and Disjoint Perfect Matchings

TL;DR

This paper proves Win's conjecture on the existence of $k$ disjoint perfect matchings in large graphs under an Ore-type degree sum condition, extending the result for cases where $k \

Contribution

It establishes the conjecture for large graphs with $k \

Findings

Win's conjecture holds for large graphs with $k \

The paper proves a new $k$-factor theorem under Ore-type conditions,

It utilizes advanced tools like Tutte's $k$-factor theorem and convex optimization

Abstract

Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent vertices is at least $n+k-2$, where $n$ is even and $n\geq k+2$. In this paper, we prove that Win's conjecture is true for $k\geq n/2$, where $n$ is sufficiently large. To show this result, we prove a theorem on $k$-factor in a graph under some Ore-type condition. Our main tools include Tutte's $k$-factor theorem, the Karush-Kuhn-Tucker theorem on convex optimization, and the solution to the longstanding 1-factor decomposition conjecture.