数学季刊 ›› 2024, Vol. 39 ›› Issue (1): 46-58.doi: 10.13371/j.cnki.chin.q.j.m.2024.01.004
郭自欢1, 魏祥林2
GUO Zi-huan1, WEI Xiang-lin2
摘要: An F-polygon is a simple polygon whose vertices are F-points, which are points of the set of vertices of a tiling of R2 by regular triangles and regular hexagons of unit edge. Let f(v) denote the least possible number of F-points in the interior of a convex F-polygon K with v vertices. In this paper we prove that f(10) = 10, f(11) = 12, f(12) = 12
中图分类号: