Packing lines in a hypercube
From MaRDI portal
Recommendations
Cited in
(14)- Partitioning the \(n\)-space into collinear sets of orthants
- scientific article; zbMATH DE number 2230313 (Why is no real title available?)
- Packing the hypercube
- The Discrepancy of Unsatisfiable Matrices and a Lower Bound for the Komlós Conjecture Constant
- The maximum number of appearances of a word in a grid
- 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
- Packing in honeycomb networks
- A Short Introduction to Optimal Line Packings
- Domination in certain chemical graphs
- Diagonalization Games
- Domination parameters in coronene torus network
- Matchings in Lattice Graphs and Hamming Graphs
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)