On a degree sequence analogue of Pósa's conjecture

DOI10.1016/j.endm.2015.06.033zbMath1346.05155OpenAlexW2178377372WikidataQ123231195 ScholiaQ123231195MaRDI QIDQ322234

Katherine Staden, Andrew Treglown

Publication date: 14 October 2016

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/26306603/eurocombpure.pdf

zbMATH Keywords

regularity lemmadegree sequencePósa's conjecturesquare of Hamilton cycle

Mathematics Subject Classification ID

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

Related Items (1)

On Degree Sequences Forcing The Square of a Hamilton Cycle

Cites Work

• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• An Ore-type theorem on Hamiltonian square cycles
• Powers of Hamilton cycles in pseudorandom 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
• Blow-up lemma
• The square of paths and cycles
• Hamiltonian square-paths
• On perfect packings in dense graphs
• On Hamilton's ideals
• 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
• 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
• Pósa's conjecture for graphs of order at least 2 × 10⁸
• Some Theorems on Abstract Graphs

This page was built for publication: On a degree sequence analogue of Pósa's conjecture