Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations

zbMath1337.05084MaRDI QIDQ289992

M. Amin Bahmanian, Michael W. Newman

Publication date: 1 June 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p42

zbMATH Keywords

embeddinghypergraphsfactorizationsedge coloringsamalgamationsdetachments

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations ⋮ Factorizations of complete multipartite hypergraphs ⋮ On regular set systems containing regular subsystems ⋮ On almost-regular edge colourings of hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
• Amalgamations of factorizations of complete graphs
• Generalized latin rectangles. II: Embedding
• Amalgamations of connected \(k\)-factorizations.
• On embedding incomplete symmetric Latin squares
• Detachments of Hypergraphs I: The Berge–Johnson Problem
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• Embedding Factorizations for 3-Uniform Hypergraphs

This page was built for publication: Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations