Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection

From MaRDI portal
Publication:6062872



Abstract: We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, n-vertex graphs G with minimum degree at least (1/2+varepsilon)n to which some random edges are added. For any Dirac graph and every integer mge2, we accurately estimate the threshold probability p=p(n) for the event that the random augmentation GcupG(n,p) contains the m-th power of a Hamiltonian cycle.












This page was built for publication: Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062872)