Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
From MaRDI portal
Publication:2452426
DOI10.1016/j.jcta.2014.04.010zbMath1295.05168arXiv1403.7932OpenAlexW1995769197MaRDI QIDQ2452426
Publication date: 3 June 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.7932
Related Items (17)
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ Euler tours in hypergraphs ⋮ Extremal problems for the \(p\)-spectral radius of Berge hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ The \(r\)-matching sequencibility of complete graphs ⋮ Unnamed Item ⋮ Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- The edge-coloring of complete hypergraphs. I
- Hamilton decompositions of complete 3-uniform hypergraphs
- Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Packing tight Hamilton cycles in 3-uniform hypergraphs
- Packing hamilton cycles in random and pseudo-random hypergraphs
- Packing Tight Hamilton Cycles in Uniform Hypergraphs
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
This page was built for publication: Decompositions of complete uniform hypergraphs into Hamilton Berge cycles