Packing tight Hamilton cycles in 3-uniform hypergraphs
From MaRDI portal
Publication:2884005
Abstract: Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1}, v_{i+2}} is an edge of C (indices are considered modulo N). We develop new techniques which enable us to prove that under certain natural pseudo-random conditions, almost all edges of H can be covered by edge-disjoint tight Hamilton cycles, for N divisible by 4. Consequently, we derive the corollary that random 3-uniform hypergraphs can be almost completely packed with tight Hamilton cycles w.h.p., for N divisible by 4 and P not too small. Along the way, we develop a similar result for packing Hamilton cycles in pseudo-random digraphs with even numbers of vertices.
Recommendations
Cites work
- scientific article; zbMATH DE number 3950585 (Why is no real title available?)
- scientific article; zbMATH DE number 2230326 (Why is no real title available?)
- Dirac-type results for loose Hamilton cycles in uniform hypergraphs
- Edge-disjoint Hamilton cycles in graphs
- Hamilton \(\ell \)-cycles in uniform hypergraphs
- Hamilton decompositions of complete 3-uniform hypergraphs
- Hamilton decompositions of regular tournaments
- Loose Hamilton cycles in hypergraphs
- Loose Hamilton cycles in random 3-uniform hypergraphs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- On two Hamilton cycle problems in random graphs
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Probabilistic methods for algorithmic discrete mathematics
- Quasi-random graphs
- Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
- Some Theorems on Abstract Graphs
- Sparse pseudo‐random graphs are Hamiltonian
Cited in
(24)- Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
- Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths
- Packing Hamilton cycles in random and pseudo-random hypergraphs
- Recent advances on the Hamiltonian problem: survey III
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
- Packing tree factors in random and pseudo-random graphs
- Packing tight Hamilton cycles in uniform hypergraphs
- Packing loose Hamilton cycles
- Approximate Hamilton decompositions of random graphs
- Tight Hamilton cycles in random uniform hypergraphs
- A counting lemma for sparse pseudorandom hypergraphs
- Rainbow Hamilton cycles in random graphs
- Tight Hamilton cycles in random hypergraphs
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
- Hamilton cycles in quasirandom hypergraphs
- Edge-disjoint Hamilton cycles in random graphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Euler tours in hypergraphs
- Finding tight Hamilton cycles in random hypergraphs faster
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs
- On packing Hamilton cycles in \(\varepsilon\)-regular graphs
- Counting results for sparse pseudorandom hypergraphs. I.
This page was built for publication: Packing tight Hamilton cycles in 3-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884005)
