Abstract
Let be an even integer, and . In this paper, we prove that every -graph of order contains disjoint perfect matchings. This result is sharp in the sense that (i) there exists a -graph containing exactly disjoint perfect matchings, and that (ii) there exists a -graph without perfect matchings for each . As a consequence, for any integer , every -graph of order contains disjoint perfect matchings. This extends Csaba et~al.'s breathe-taking result that every -regular graph of sufficiently large order is -factorizable, generalizes Zhang and Zhu's result that every -regular graph of order contains disjoint perfect matchings, and improves Hou's result that for all , every -graph of order contains disjoint perfect matchings.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.