On Degree Sequences Forcing The Square of a Hamilton Cycle

DOI10.1137/15M1033101zbMath1358.05072arXiv1412.3498OpenAlexW2963693130MaRDI QIDQ2968516

Andrew Treglown, Katherine Staden

Publication date: 16 March 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Hamilton cycleregularity methodPósa's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ Minimum Degrees for Powers of Paths and Cycles ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ The bandwidth theorem for locally dense graphs ⋮ On the relation of separability, bandwidth and embedding ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ Dirac's Condition for Spanning Halin Subgraphs ⋮ A degree sequence Hajnal-Szemerédi theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• On a degree sequence analogue of Pósa's conjecture
• An Ore-type theorem on Hamiltonian square cycles
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• The Ramsey number of a graph with bounded maximum degree
• On circuits in graphs
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Packings of graphs and applications to computational complexity
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• The square of paths and cycles
• 2-factors in dense graphs
• Hamiltonian square-paths
• On perfect packings in dense graphs
• On Hamilton's ideals
• Large planar subgraphs in dense graphs
• On Degree Sequences Forcing The Square of a Hamilton Cycle
• Filling the gap between Turán's theorem and Pósa's conjecture
• Note on Hamilton Circuits
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• The Square of a Hamiltonian Cycle
• Partitioning a graph into two square-cycles
• On the square of a Hamiltonian cycle in dense graphs
• On Pósa's Conjecture for Random Graphs
• Ore-degree threshold for the square of a Hamiltonian cycle
• An Extension of the Blow-up Lemma to Arrangeable Graphs
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Powers of Hamilton Cycles in Pseudorandom Graphs
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Spanning triangulations in graphs
• Some Theorems on Abstract Graphs