One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
https://doi.org/10.1134/s0001434620030141
Copy DOI
Export
Save
Share
Cite Journal: Mathematical Notes |  Publication Date: Mar 1, 2020 |
Affiliation: Hebei University of Science and Technology
An H-polygon is a simple polygon whose vertices are H-points, which are points of the set of vertices of a tiling of ℝ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 G(12) = 12.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
