Partitions and balanced matchings of an \(n\)-dimensional cube
From MaRDI portal
Publication:402466
DOI10.1016/j.ejc.2014.02.005zbMath1297.05048OpenAlexW2008566324MaRDI QIDQ402466
Publication date: 28 August 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.02.005
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattice packing and covering (number-theoretic aspects) (11H31) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)
Related Items
On the structure of cube tiling codes ⋮ Irreducible subcube partitions ⋮ On Keller's conjecture in dimension seven
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Keller's conjecture in dimension seven
- The structure of cube tilings under symmetry conditions
- Minimal partitions of a box into boxes
- Polyboxes, cube tilings and rigidity
- Combinatorial cube packings in the cube and the torus
- Cube tiling and covering a complete graph
- Cube-tilings of \(\mathbb{R}^ n\) and nonlinear codes
- Lattice tilings by cubes: Whole, notched and extended
- Rigid polyboxes and Keller's conjecture
- A cube tiling of dimension eight with no facesharing
- Existence of a maximum balanced matching in the hypercube
- A combinatorial approach for Keller's conjecture
- Über lückenlose Ausfüllung des \(n\)-dimensionalen Raumes durch kongruente Würfel
- Keller’s conjecture on the existence of columns in cube tilings of ℝn
- Keller’s cube-tiling conjecture is false in high dimensions
