Packing lines in a hypercube
From MaRDI portal
Publication:686153
DOI10.1016/0012-365X(93)90327-PzbMATH Open0784.05022OpenAlexW2046684026MaRDI QIDQ686153FDOQ686153
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
Cited In (14)
- Partitioning the \(n\)-space into collinear sets of orthants
- Title not available (Why is that?)
- Packing the hypercube
- The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
- The fullerene graphs with a perfect star packing
- Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs
- Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures
- A Short Introduction to Optimal Line Packings
- Packing in honeycomb networks
- Domination in certain chemical graphs
- Diagonalization Games
- Domination parameters in coronene torus network
- The Maximum Number of Appearances of a Word in a Grid
- Matchings in Lattice Graphs and Hamming Graphs
Recommendations
This page was built for publication: Packing lines in a hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686153)