\(H\)-triangles with \(k\) interior \(H\)-points (Q998338): Difference between revisions

An \(H\)-point is defined to be a vertex of a regular hexagonal tiling of the plane. An \(H\)-triangle is defined to be a triangle whose vertices are \(H\)-points. It is shown that the number of boundary \(H\)-points of an \(H\)-triangle with exactly \(k\) interior \(H\)-points is at most \(3k+7\), and not equal to \(3k+6\). It is conjectured that all other values from \(3\) to \(3k+5\) can occur. It is also conjectured that for any convex polygon with \(v\) vertices, all of them \(H\)-points, the inequality \(b\leq 3i-v+10\) holds, where \(b\) denotes the the number of boundary \(H\)-points, and \(i\) the number of interior \(H\)-points.