Hamiltonian decompositions of complete k-uniform hypergraphs

DOI10.1016/J.DISC.2009.03.047zbMATH Open1221.05253OpenAlexW2146551015MaRDI QIDQ712220FDOQ712220

Authors: Robert F. Bailey, Brett Stevens 

Publication date: 28 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.047

Recommendations

• On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
• Hamiltonian decompositions of complete graphs
• Hamilton decompositions of complete 3-uniform hypergraphs
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
• Hamilton decomposition of complete 3-uniform hypergraphs
• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
• Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles

zbMATH Keywords

Hamiltonian cycleuniform hypergraphHamiltonian decompositionlarge setdifference patterndirected terraceHamiltonian chain

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Hamiltonian chains in hypergraphs
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• Large sets of \(t\)-designs through partitionable sets: a survey
• Title not available (Why is that?)
• Universal cycles for combinatorial structures
• Cycle decompositions of complete graphs
• Title not available (Why is that?)
• Constructing combinatorial objects via cliques
• The wonderful Walecki construction
• Hamilton decompositions of complete 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Round-dance neighbour designs from terraces
• Constructions via Hamiltonian theorems

Cited In (44)

• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
• Packing Hamilton cycles in random and pseudo-random hypergraphs
• Hamiltonian uniform subset graphs
• Recent advances on the Hamiltonian problem: survey III
• Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
• Hamiltonian decomposition of generalized recursive circulant graphs
• Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles
• Hamilton decompositions of complete 3-uniform hypergraphs
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• Title not available (Why is that?)
• The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs
• On Hamiltonian decompositions of complete 3-uniform hypergraphs
• Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
• Hamilton decomposition of complete 3-uniform hypergraphs
• On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor
• On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
• Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
• Steiner system and large non-Hamiltonian hypergraphs
• Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
• Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
• Graph and hypergraph packing
• A note on Hamilton \(\ell\)-cycle decomposition of complete \(k\)-partite hypergraphs
• On tight 6-cycle decompositions of complete 3-uniform hypergraphs
• Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
• On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Constructions via Hamiltonian theorems
• Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
• Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares
• Title not available (Why is that?)
• Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles
• Euler tours in hypergraphs
• Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\)
• Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
• On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• GAP
• GRAPE

This page was built for publication: Hamiltonian decompositions of complete \(k\)-uniform hypergraphs

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