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

In 1962 Pósa conjectured that every graph G on n vertices with minimum degree contains the square of a hamiltonian cycle. In 1996 Fan and Kierstead proved the path version of Pósa's Conjecture. They also proved that it would suffice to show that G contains the square of a cycle of length greater than. Still in 1996, Komlós, Sárközy, and Szemerédi proved Pósa's Conjecture, using the Regularity and Blow-up Lemmas, for graphs of order n ≥ n₀, where n₀ is a very large constant. Here we show without using these lemmas that n₀:= 2 × 10⁸ is sufficient. We are motivated by the recent work of Levitt, Sárközy and Szemerédi, but our methods are based on techniques that were available in the 90's.