On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges

DOI10.1007/978-3-031-52969-6_29zbMATH Open1548.05265MaRDI QIDQ6616841

Cody Hatzer, R. C. Bunge, Jacquelyn Maass, Mary Donovan, Erin Dawson

Publication date: 9 October 2024

zbMATH Keywords

decompositionhypergraphslinear forest

Mathematics Subject Classification ID

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

Cites Work

• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
• Solution of a delta-system decomposition problem
• Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
• A survey on the existence ofG-Designs
• 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?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges

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