6-cycle decompositions of complete 3-uniform hypergraphs

zbMATH Open1468.05229MaRDI QIDQ5000290FDOQ5000290

T. Poovaragavan, R. Lakshmi

Publication date: 12 July 2021

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p079.pdf

Recommendations

• On tight 6-cycle decompositions of complete 3-uniform hypergraphs
• On tight 9-cycle decompositions of complete 3-uniform hypergraphs
• Decompositions of complete 3-uniform hypergraphs into cycles of constant prime length
• Decompositions of complete 3-uniform hypergraphs into cycles of some special even lengths
• 4-cycle decompositions of complete 3-uniform hypergraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Hamilton decompositions of complete 3-uniform hypergraphs
• Title not available (Why is that?)
• On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: 6-cycle decompositions of complete 3-uniform hypergraphs

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