Hamilton cycles in quasirandom hypergraphs

Research output: Contribution to journalArticle

Authors

Colleges, School and Institutes

External organisations

  • UNIVERSITY OF ILLINOIS, CHICAGO

Abstract

We show that, for a natural notion of quasirandomness in k-uniform hypergraphs, any quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum vertex degree Ω(nk-1) contains a loose Hamilton cycle. We also give a construction to show that a k-uniform hypergraph satisfying these conditions need not contain a Hamilton ℓ-cycle if k– ℓ divides k. The remaining values of ℓ form an interesting open question. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 2016

Details

Original languageEnglish
JournalRandom Structures and Algorithms
Early online date26 Feb 2016
Publication statusE-pub ahead of print - 26 Feb 2016

Keywords

  • hypergraphs, Hamilton cycles, quasirandomness