Abstract
AbstractWe study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, ‐vertex graphs with minimum degree at least to which some random edges are added. For any Dirac graph and every integer , we accurately estimate the threshold probability for the event that the random augmentation contains the ‐th power of a Hamiltonian cycle.
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.
