High powers of Hamiltonian cycles in randomly augmented graphs

DOI10.1002/jgt.22691zbMath1522.05259arXiv2002.05816OpenAlexW3175538011WikidataQ114236151 ScholiaQ114236151MaRDI QIDQ6056783

Christian Reiher, Mathias Schacht, Andrzej Ruciński, Andrzej Dudek, Sylwia Antoniuk

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.05816

zbMATH Keywords

powers of Hamilton cyclesaugmented graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (6)

Triangles in randomly perturbed graphs ⋮ Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Hamiltonicity of graphs perturbed by a random regular graph ⋮ On powers of tight Hamilton cycles in randomly perturbed hypergraphs ⋮ Hamiltonicity of graphs perturbed by a random geometric graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• \(H\)-factors in dense graphs
• On extremal problems of graphs and generalized graphs
• Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
• How many random edges make a dense graph hamiltonian?
• Sprinkling a Few Random Edges Doubles the Power
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Powers of Hamiltonian cycles in randomly augmented graphs
• Some Theorems on Abstract Graphs

This page was built for publication: High powers of Hamiltonian cycles in randomly augmented graphs