A note about interior H-points of convex H-hendecagon

摘要

An H-polygon is a simple polygon whose vertices are H-points, which are points of the set of vertices of a tiling of R-2 by regular hexagons of unit edge. Let G(v) denote the least possible number of H-points in the interior of a convex H-polygon K with v vertices. In this paper we prove that 10 <= G(11) <= 12.