Two packing problems on \(k\)-matroid trees

DOI10.1016/S0195-6698(13)80113-8zbMath0756.05082MaRDI QIDQ1178033

David A. Grable

Publication date: 26 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

packing problems\(k\)-uniform hypergraphs\(k\)-matroid treesTree Packing Conjecture

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Hypertrees and Bonferroni inequalities
• Characterizing binary simplicial matroids
• Packing graphs with odd and even trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two packing problems on \(k\)-matroid trees