On Posa's conjecture for random graphs

Details On Posa's conjecture for random graphs On Posa's conjecture for random graphs

2012-03-28

arxiv.org/abs/1203.6310v1

Mathematics

Combinatorics

Scientific paper

The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps}, then asymptotically almost surely, the binomial random graph G_{n,p} contains the square of a Hamilton cycle. This provides an `approximate threshold' for the property in the sense that the result fails to hold if p< n^{-1/2}.

Affiliated with

Also associated with

No associations

Rating

On Posa's conjecture for random graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Posa's conjecture for random graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Posa's conjecture for random graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273223