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, -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.
Recommendations
Cites work
- High powers of Hamiltonian cycles in randomly augmented graphs
- How many random edges make a dense graph hamiltonian?
- On the square of a Hamiltonian cycle in dense graphs
- Powers of Hamiltonian cycles in randomly augmented graphs
- Proof of the Seymour conjecture for large graphs
- Some Theorems on Abstract Graphs
- Sprinkling a few random edges doubles the power
Cited in
(4)
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)