Extending factorizations of complete uniform hypergraphs

DOI10.1007/S00493-017-3396-3MaRDI QIDQ2416440zbMATH OpenOpenAlexWikidataFDO

Authors M. A. Bahmanian, Mike Newman

Publication date 23 May 2019

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-017-3396-3

zbMATH Keywords

factorizationuniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Embedding connected factorizations
• Embedding factorizations for 3-uniform hypergraphs
• Connected Baranyai's theorem
• scientific article; zbMATH DE number 4012665

Cited in

(10)

• Embedding connected factorizations. II
• A note on the 1-factorization of non-uniform complete hypergraph
• Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
• Embedding connected factorizations
• On regular set systems containing regular subsystems
• scientific article; zbMATH DE number 4012665 (Why is no real title available?)
• Embedding factorizations for 3-uniform hypergraphs
• Symmetric factorizations of the complete uniform hypergraph
• scientific article; zbMATH DE number 7283879 (Why is no real title available?)
• Extending regular edge-colorings of complete hypergraphs

This page was built for publication: Extending factorizations of complete uniform hypergraphs

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