On the number of non-hexagons in a planar tiling
classification
🧮 math.MG
keywords
numbertilingconvexexceptfinitegivehexagonsless
read the original abstract
We give a simple proof of T. Stehling's result, that in any normal tiling of the plane with convex polygons with number of sides not less than six, all tiles except the finite number are hexagons.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.