Posa's Conjecture for Graphs of Order At Least 2 x 10(8)
In 1962 Posa conjectured that every graph G on n vertices with minimum degree delta(G)  = n(0), where n(0) is a very large constant. Here we show without using these lemmas that n(0) := 2 x 10(8) is sufficient. We are motivated by the recent work of Levitt, Sarkozy and Szemeredi, but our methods are based on techniques that were available in the 90's. (C) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 39, 507-525, 2011
posa's conjecture powers of cycles square cycle