Powers of Hamilton Cycles in Pseudorandom Graphs
From MaRDI portal
Publication:5405054
DOI10.1007/978-3-642-54423-1_31zbMath1406.05092arXiv1402.0984OpenAlexW2894788058MaRDI QIDQ5405054
No author found.
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0984
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
On the size-Ramsey number of grid graphs ⋮ A spanning bandwidth theorem in random graphs ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems
This page was built for publication: Powers of Hamilton Cycles in Pseudorandom Graphs
