Periodica Mathematica Hungarica

, Volume 21, Issue 2, pp 95–100 | Cite as

A combinatorial approach for Keller's conjecture

  • K. Corrádi
  • S. Szabó


The statement, that in a tiling by translates of ann-dimensional cube there are two cubes having common (n-1)-dimensional faces, is known as Keller's conjecture. We shall prove that there is a counterexample for this conjecture if and only if the following graphsΓ n has a 2 n size clique. The 4 n vertices ofΓ n aren-tuples of integers 0, 1, 2, and 3. A pair of thesen-tuples are adjacent if there is a position at which the difference of the corresponding components is 2 modulo 4 and if there is a further position at which the corresponding components are different. We will give the size of the maximal cliques ofΓ n forn≤5.

Mathematics Subject Classification 1980/85

Primary 10E30 Secondary 20K01 

Key words and phrases

Cube tilings Keller's conjecture factorization of finite abelian groups 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.Hajós, Sur la factoriasation des groupes abeliensCasopis 74 (1950), 189–196.Zbl 39, 19Google Scholar
  2. [2]
    O. H.Keller, Über die lückenlose Erfüllung des Raumes mit Würfeln,J. Reine Angew. Math. 163 (1930), 231–248.Google Scholar
  3. [3]
    O.Perron, Über lückenlose Ausfüllung desn-dimensionalen Raumes durch kongruente Würfel, Math.Z. 46 (1940), 1–26, 161–180.Zbl 22, 202Google Scholar
  4. [4]
    S. K.Stein, Algebraic tiling,Amer. Math. Monthly 81 (1974), 445–462.Zbl 284: 20048Google Scholar
  5. [5]
    S.Szabó, A reduction of Keller's conjecture,Periodica Math. Hung. 17 (4), (1986), pp. 265–277.Zbl 613: 52006Google Scholar

Copyright information

© Akadémiai Kiadó 1990

Authors and Affiliations

  • K. Corrádi
    • 1
    • 2
  • S. Szabó
    • 1
    • 2
  1. 1.Dept. of computer TechnEötvös Loránd univBudapestHungary
  2. 2.Dept. of civil engineering mathTech. univ. BudapestBudapestHungary

Personalised recommendations