Pósa's Conjecture for graphs of order at least 2\times 10^8
Abstract
In 1962 Pósa conjectured that every graph G on n vertices with minimum degree at least 2n/3 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 2n/3. Still in 1996, Komlós, Sárközy, and Szemerédi proved Pósa's Conjecture, using the Regularity and Blowup Lemmas, for graphs of order n > n_0, where n_0 is a very large constant. Here we show without using these lemmas that n_0=2\times 10^8 is sufficient. We are motivated by the recent work of Levitt, Szemerédi and Sárközy, but our methods are based on techniques that were available in the 90's.
 Publication:

arXiv eprints
 Pub Date:
 April 2011
 DOI:
 10.48550/arXiv.1104.4367
 arXiv:
 arXiv:1104.4367
 Bibcode:
 2011arXiv1104.4367C
 Keywords:

 Mathematics  Combinatorics;
 05C35
 EPrint:
 20 pages, to appear in Random Structures &