Skip to main content Accessibility help

Isoperimetric problems for tilings, corrigendum

  • L. Fejes Tóth (a1)


In [1] I made the following conjecture. If we tile a convex polygon of at most six sides with N convex tiles of areas a1, …,aN, then the total perimeter of the tiles is never less than the total perimeter of N regular hexagons of areas a1, …, aN. In order to show that the condition of the convexity of the tiles cannot be omitted I constructed a tiling with an equal number of “pentagons” and “heptagons” of perimeters and areas and , and ā5 and ā7, respectively. In a letter to me R. Schneider kindly pointed out that, in contrast to the value given in [1], the value of the quotient was equal to 3.7263… This being greater than √8√3 = 3–7224… the tiling given in [1] does not yield the desired counter-example. In what follows we shall construct a tiling for which the respective quotient will turn out to be less than √8√3.



Hide All
1.TÓth, L. Fejes. Isoperimetric problems for tilings. Mathematika, 32 (1985), 1015.
MathJax is a JavaScript display engine for mathematics. For more information see


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed