Embedding Factorizations for 3-Uniform Hypergraphs II:$r$-Factorizations into $s$-Factorizations

Electronic Journal Of Combinatorics

Amin Bahmanian¹ 

关键词: Factorizations;    Embedding;    Detachments;    Amalgamations;    Edge-colorings;    Hypergraphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Motivated by a 40-year-old problem due to Peter Cameron on extending partial parallelisms, we provide necessary and sufficient conditions under which one can extend an $r$-factorization of a complete $3$-uniform hypergraph on $m$ vertices, $K_m^3$, to an

【 授权许可】

Others