Balanced integer arrays: a matrix packing theorem

DOI10.1016/0097-3165(83)90045-6zbMath0504.05024OpenAlexW1968244010MaRDI QIDQ1835678

Peter C. Fishburn

Publication date: 1983

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(83)90045-6

zbMATH Keywords

permutation of the componentsvector of column sums

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

An approximate version of the tree packing conjecture ⋮ Packing trees in complete graphs ⋮ Optimal packings of bounded degree trees ⋮ Packing sequences

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Balanced integer arrays: a matrix packing theorem