Packing lines in a hypercube

DOI10.1016/0012-365X(93)90327-PzbMath0784.05022OpenAlexW2046684026MaRDI QIDQ686153

Alexander Felzenbaum, Ron Holzman, Daniel J. Kleitman

Publication date: 20 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90327-p

zbMATH Keywords

hypercube\(n\)-cubepacking lines

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items (11)

The fullerene graphs with a perfect star packing ⋮ The Maximum Number of Appearances of a Word in a Grid ⋮ Matchings in Lattice Graphs and Hamming Graphs ⋮ Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs ⋮ The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant ⋮ Packing the hypercube ⋮ Domination in certain chemical graphs ⋮ Packing in honeycomb networks ⋮ Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures ⋮ Domination parameters in coronene torus network ⋮ Unnamed Item

This page was built for publication: Packing lines in a hypercube