Hamilton cycles in quasirandom hypergraphs

DOI10.1002/RSA.20638MaRDI QIDQ2820275zbMATH OpenOpenAlexFDO

Authors John Lenz, Dhruv Mubayi, Richard Mycroft

Publication date 15 September 2016

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

Full work available at URL https://arxiv.org/abs/1502.04041, https://research.birmingham.ac.uk/portal/en/publications/hamilton-cycles-in-quasirandom-hypergraphs(8361bf94-8a42-403d-a638-3560059c04d5).html

zbMATH Keywords

Hamilton cycleshypergraphsquasirandomness

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

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 $Omega(n^{k-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 $ell$-cycle if $k-ell$ divides $k$. The remaining values of $ell$ form an interesting open question.

Recommendations

• Loose Hamilton cycles in random uniform hypergraphs
• Loose Hamilton cycles in hypergraphs
• Loose Hamilton cycles in random 3-uniform hypergraphs
• Packing tight Hamilton cycles in uniform hypergraphs
• Hamiltonicity in randomly perturbed hypergraphs

Cites work

• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An approximate Dirac-type theorem for k-uniform hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Eigenvalues and linear quasirandom hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs
• Hamilton cycles in highly connected and expanding graphs
• Hamilton cycles in sparse robustly expanding digraphs
• Hamiltonian chains in hypergraphs
• Hamiltonian degree sequences in digraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Loose Hamilton cycles in hypergraphs
• Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing tight Hamilton cycles in uniform hypergraphs
• Perfect packings in quasirandom hypergraphs. I.
• Quasi-random graphs
• Some Theorems on Abstract Graphs
• The poset of hypergraph quasirandomness

Cited in

(13)

• Hamiltonicity in cherry-quasirandom 3-graphs
• Euler tours in hypergraphs
• scientific article; zbMATH DE number 5081142 (Why is no real title available?)
• Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
• Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• FF‐factors in Quasi‐random Hypergraphs
• Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
• Transversals via regularity
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
• Clique factors in pseudorandom graphs
• Hamiltonicity in randomly perturbed hypergraphs
• Hamilton \(\ell \)-cycles in uniform hypergraphs

This page was built for publication: Hamilton cycles in quasirandom hypergraphs

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