On powers of tight Hamilton cycles in randomly perturbed hypergraphs

DOI10.1002/rsa.21154arXiv2007.11775OpenAlexW4366087683MaRDI QIDQ6076728

Jie Han, Lubos Thoma, Yu-Lin Chang

Publication date: 17 October 2023

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

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

zbMATH Keywords

absorbing methodpowers of Hamilton cyclesrandomly perturbed hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On extremal hypergraphs for Hamiltonian cycles
• Loose Hamilton cycles in random uniform hypergraphs
• Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Hamiltonicity in randomly perturbed hypergraphs
• Supersaturated graphs and hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• 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
• Proof of the Seymour conjecture for large graphs
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Families of triples with high minimum degree are Hamiltonian
• Spanning structures and universality in sparse hypergraphs
• Recent advances on Dirac-type problems for hypergraphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Hamiltonian chains in hypergraphs
• Spanning Subgraphs of Random Graphs
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• How many random edges make a dense graph hamiltonian?
• On Pósa's Conjecture for Random Graphs
• Tight Hamilton cycles in random uniform hypergraphs
• Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs
• Sprinkling a Few Random Edges Doubles the Power
• The threshold for the square of a Hamilton cycle
• Reducibility among Combinatorial Problems
• EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
• Powers of Hamiltonian cycles in randomly augmented graphs
• Spanning trees in randomly perturbed graphs
• Squares of Hamiltonian cycles in 3‐uniform hypergraphs
• Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Universality for bounded degree spanning trees in randomly perturbed graphs
• Tilings in Randomly Perturbed Dense Graphs
• Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
• Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
• Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version
• Some Theorems on Abstract Graphs
• Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
• High powers of Hamiltonian cycles in randomly augmented graphs

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