Abstract
We obtain a sharp result that for any even n ? 34, every {Dn,Dn+1}-regular graph of order n contains ?n/4? disjoint perfect matchings, where Dn = 2?n/4?-1. As a consequence, for any integer D ? Dn, every {D, D+1}- regular graph of order n contains (D-?n/4?+1) disjoint perfect matchings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
