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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
