Powers of tight Hamilton cycles in randomly perturbed hypergraphs

Authors:

Abstract
For k ≥ 2 and r ≥ 1 such that k + r ≥ 4, we prove that, for any α > 0, there exists ε > 0 such that the union of an n‐vertex k‐graph with minimum codegree and a binomial random k‐graph with on the same vertex set contains the rth power of a tight Hamilton cycle with high probability. This result for r = 1 was first proved by McDowell and Mycroft.
Funding Information
  • FAPESP (2014/18641-5, 2013/03447-6, 2018/04876-1)
  • CNPq (310974/2013-5, 311412/2018-1, 423833/2018-9, 304733/2017-2, 428385/2018-4)

This publication has 33 references indexed in Scilit: