Name
Abstract | ||
|---|---|---|
n H-triangle is a triangle with corners in the set of vertices of a tiling of R^2 by regular hexagons of unit edge. It is known that any H-triangle with exactly 1 interior H-point can have at most 10 H-points on its boundary. In this note we prove that any H-triangle with exactly k interior H-points can have at most 3k+7 boundary H-points. Moreover we form two conjectures dealing with H-polygons. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.disc.2007.11.020 | Discrete Mathematics |
Keywords | Field | DocType |
h -point,hexagonal tile,pick’s theorem,triangular lattice,pick's theorem,h -triangle,h-point,pick s theorem,h | Hexagonal lattice,Discrete mathematics,Combinatorics,Polygon,Monad (category theory),Vertex (geometry),Lattice (order),Interior,Pick's theorem,Mathematics,Algebraic interior | Journal |
Volume | Issue | ISSN |
308 | 24 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang-Lin Wei | 1 | 117 | 26.16 |
| Ren Ding | 2 | 17 | 7.18 |