Cube tiling and covering a complete graph

DOI10.1016/0012-365X(90)90388-XzbMath0736.05024OpenAlexW1984454398MaRDI QIDQ1173697

Sándor Szabó, Keresztély Corrádi

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90388-x

zbMATH Keywords

coveringbipartite graphscomplete graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of tessellation and tiling problems (05B45) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Towards resolving Keller's cube tiling conjecture in dimension seven ⋮ Partitions and balanced matchings of an \(n\)-dimensional cube ⋮ Rigidity and the chessboard theorem for cube packings ⋮ Rigid polyboxes and Keller's conjecture ⋮ On Keller's conjecture in dimension seven ⋮ The structure of cube tilings under symmetry conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Multiple tilings of \(n\)-dimensional space by unit cubes
• A reduction of Keller's conjecture
• How Does a Complete Graph Split into Bipartite Graphs and How are Neighborly Cubes Arranged?
• Algebraic Tiling

This page was built for publication: Cube tiling and covering a complete graph