Tight Hamilton cycles in random uniform hypergraphs

  1. Andrzej Dudek1,*,
  2. Alan Frieze2

Article first published online: 5 FEB 2012

DOI: 10.1002/rsa.20404

Additional Information

How to Cite

Dudek, A. and Frieze, A. (2012), Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Alg.. doi: 10.1002/rsa.20404

Author Information

  1. 1

    Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008

  2. 2

    Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213

*Department of Mathematics, Western Michigan University, Kalamazoo, Michigan 49008

Publication History

  1. Article first published online: 5 FEB 2012
  2. Manuscript Accepted: 13 MAY 2011
  3. Manuscript Received: 12 JAN 2011

Funded by

  • NSF. Grant Number: CCF0502793

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

View Full Article (HTML) Get PDF (123K)

Keywords:

  • Hamiltonicity;
  • random hypergraphs

Abstract

In this paper we show that e/n is the sharp threshold for the existence of tight Hamilton cycles in random k -uniform hypergraphs, for all k ≥ 4. When k = 3 we show that 1/n is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012

View Full Article (HTML) Get PDF (123K)