On hypercube packings, blocking sets and a covering problem
From MaRDI portal
Publication:477608
Recommendations
Cites work
- A covering problem for tori
- A user's guide to tabu search
- Bounds on the domination number of Kneser graphs
- Classification algorithms for codes and designs
- Cube packings, second moment and holes
- Cube tilings as contributions of algebra to geometry
- Enumerating cube tilings
- Football Pools--A Game for Mathematicians
- Isomorph-Free Exhaustive Generation
- Keller’s cube-tiling conjecture is false in high dimensions
- On the Shannon capacity of a graph
- On the minimum size of 4-uniform hypergraphs without property \(B\)
- Practical graph isomorphism. II.
- Random sequential packing of cubes
- Relations between packing and covering numbers of a tree
- The inverse football pool problem
Cited in
(5)
This page was built for publication: On hypercube packings, blocking sets and a covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477608)