Pósa's conjecture for graphs of order at least 2 × 108

DOI10.1002/RSA.20376zbMath1238.05157arXiv1104.4367OpenAlexW1989326777WikidataQ123284330 ScholiaQ123284330MaRDI QIDQ5388972

Phong Châu, Louis DeBiasio, Henry A. Kierstead

Publication date: 24 April 2012

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

powers of cyclessquare cyclePósa's Conjecture

Mathematics Subject Classification ID

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

Related Items (16)

Minimum Degrees for Powers of Paths and Cycles ⋮ Monochromatic cycle power partitions ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ An Ore-type theorem on Hamiltonian square cycles ⋮ Stability for vertex cycle covers ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ Covering cycles in sparse graphs ⋮ Hamiltonian cycles with all small even chords ⋮ Characterizing forbidden pairs for Hamiltonian squares ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Monochromatic bounded degree subgraph partitions ⋮ The critical window for the classical Ramsey-Turán problem ⋮ Ramsey Number of a Connected Triangle Matching ⋮ Monochromatic square-cycle and square-path partitions

Cites Work

• Unnamed Item
• Unnamed Item
• How to avoid using the regularity Lemma: Pósa's conjecture revisited
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• The square of paths and cycles
• Hamiltonian square-paths
• A note on some embedding problems for oriented graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Partitioning a graph into two square-cycles
• On the square of a Hamiltonian cycle in dense graphs
• Some Theorems on Abstract Graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Pósa's conjecture for graphs of order at least 2 × 10⁸