On powers of tight Hamilton cycles in randomly perturbed hypergraphs

DOI10.1002/RSA.21154arXiv2007.11775OpenAlexW4366087683MaRDI QIDQ6076728FDOQ6076728

Authors: Yu-Lin Chang, Jie Han, Luboš Thoma 

Publication date: 17 October 2023

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: For integers $kgeq3$ and $rgeq2$, we show that for every $alpha>0$, there exists $varepsilon>0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $alphan$ and a binomial random $k$-uniform hypergraph $G^{(k)}(n,p)$ with $$ on the same vertex set contains the $r^{th}$ power of a tight Hamilton cycle with high probability. Moreover, a construction shows that one cannot take $varepsilon>Calpha$, where $C=C(k,r)$ is a constant. Thus the bound on $p$ is optimal up to the value of $varepsilon$ and this answers a question of Bedenknecht, Han, Kohayakawa, and Mota.

Full work available at URL: https://arxiv.org/abs/2007.11775

Recommendations

• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• Tight Hamilton cycles in random hypergraphs
• Tight Hamilton cycles in random uniform hypergraphs
• Powers of Hamiltonian cycles in randomly augmented graphs
• Powers of Hamilton cycles in pseudorandom graphs
• Powers of Hamilton cycles in pseudorandom graphs
• High powers of Hamiltonian cycles in randomly augmented graphs
• Hamiltonicity in randomly perturbed hypergraphs

zbMATH Keywords

absorbing methodpowers of Hamilton cyclesrandomly perturbed hypergraphs

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites Work

• Reducibility among combinatorial problems
• Title not available (Why is that?)
• Proof of the Seymour conjecture for large graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Spanning trees in randomly perturbed graphs
• Some Theorems on Abstract Graphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Hamiltonian chains in hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• On extremal hypergraphs for Hamiltonian cycles
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Hamiltonian circuits in random graphs
• Spanning structures and universality in sparse hypergraphs
• Dirac-type questions for hypergraphs -- a survey (or more problems for Endre to solve)
• Spanning Subgraphs of Random Graphs
• How many random edges make a dense graph hamiltonian?
• On Pósa's conjecture for random graphs
• Tight Hamilton cycles in random uniform hypergraphs
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Universality for bounded degree spanning trees in randomly perturbed graphs
• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Supersaturated graphs and hypergraphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Families of triples with high minimum degree are Hamiltonian
• Recent advances on Dirac-type problems for hypergraphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Title not available (Why is that?)
• Tilings in randomly perturbed dense graphs
• Title not available (Why is that?)
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version
• Hamiltonicity in randomly perturbed hypergraphs
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
• Powers of Hamiltonian cycles in randomly augmented graphs
• Sprinkling a few random edges doubles the power
• Squares of Hamiltonian cycles in 3-uniform hypergraphs
• The threshold for the square of a Hamilton cycle
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• High powers of Hamiltonian cycles in randomly augmented graphs

Cited In (4)

• High powers of Hamiltonian cycles in randomly augmented graphs
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• On powers of Hamilton cycles in Ramsey-Turán theory
• Compatible powers of Hamilton cycles in dense graphs

This page was built for publication: On powers of tight Hamilton cycles in randomly perturbed hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076728)