Abstract
For a natural number k, let C k (G) denote the maximal subgraph of G with minimal degree ≥k and let M k be the property that a graph has disjoint hamiltonian cycles plus a disjoint perfect matching if k is odd. We show that for the random graph k n,m with n labelled vertices and edges we have
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.
