On the maximum packing problem of MP_ (3,K^(3)_4-e,v).

zbMATH Open1313.05263MaRDI QIDQ2936725FDOQ2936725

Authors: Yan Wu, Yanxun Chang 

Publication date: 6 January 2015

Recommendations

• Decompositions of the 3-uniform hypergraphs \(K_{v}^{(3)}\) into hypergraphs of a certain type
• Decompositions of \(\lambda\)-fold complete bipartite 3-uniform hypergraphs \(\lambda K^{(3)}_{n,n}\) into hypergraph \(K_4^{(3)}-e\)
• Decompositions of 3-uniform hypergraph \(K_v^{(3)}\) into hypergraph \(K_4^{3}+ e\)
• Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
• Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs

zbMATH Keywords

packing numberleavehypergraph decomposition\(t-(v,\Gamma ,\lambda)\) packingcandelabra \((\Gamma ,t)\)-systemgroup divisible \((\Gamma ,t)\)-design

Mathematics Subject Classification ID

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

Cited In (5)

• Decompositions of 3-uniform hypergraph \(K_v^{(3)}\) into hypergraph \(K_4^{3}+ e\)
• On maximum packings of \(\lambda \)-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
• Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
• Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
• Determination of the packing number \(D_{\lambda }(3,W_4^{(3)},\nu )\)

This page was built for publication: On the maximum packing problem of \(MP_{\lambda }(3,K^{(3)}_4-e,v)\).

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