go-v.orgdoi

Loose Hamilton Cycles in Random 3-Uniform Hypergraphs

ALAN M. FRIEZE · The Electronic Journal of Combinatorics · 2010

  • DOI 10.37236/477
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2010

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010

Abstract

In the random hypergraph $H=H_{n,p;3}$ each possible triple appears independently with probability $p$. A loose Hamilton cycle can be described as a sequence of edges $\{x_i,y_i,x_{i+1}\}$ for $i=1,2,\ldots,n/2$ where $x_1,x_2,\ldots,x_{n/2},y_1,y_2,\ldots,y_{n/2}$ are all distinct. We prove that there exists an absolute constant $K>0$ such that if $p\geq {K\log n\over n^2}$ then $$\lim_{\textstyle{n\to \infty\atop 4|n}}\Pr(H_{n,p;3}\ contains\ a\ loose\ Hamilton\ cycle)=1.$$

Open the resolved locator · 10.37236/477

Metadata licence: OpenAlex metadata (CC0)