Mathematics – Combinatorics
Scientific paper
2010-06-09
Mathematics
Combinatorics
14 pages
Scientific paper
In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\log n$ tends to infinity with $n$ then $$\lim_{\substack{n\to \infty 2(k-1) |n}}\Pr(H_{n,p;k}\ contains\ a\ loose\ Hamilton\ cycle)=1.$$ This is asymptotically best possible.
Dudek Andrzej
Frieze Alan
No associations
LandOfFree
Loose Hamilton Cycles in Random Uniform Hypergraphs 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 Loose Hamilton Cycles in Random Uniform Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loose Hamilton Cycles in Random Uniform Hypergraphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-490277