Smallest Limited Vertex-to-vertex Snakes of Unit Triangles |
| |
| Authors: | Heiko Harborth László Szabo Zoltán Ujváry-Menyhárt |
| |
| Affiliation: | (1) Diskrete Mathematik, Technische Universität Braunschweig, Pockelsstr. 14, D-38106 Braunschweig, Germany;(2) Hungarian Academy of Sciences, Computer and Automation Institute, Lágymányosi út 11, H-1111 Budapest, Hungary |
| |
| Abstract: | A sequence T= T1,T2,...,Tn of regular triangles of unit side lengths is called a vertex-to-vertex snake if T T is a common vertex of T and T if |i-j|=1 and is empty if |i-j|<1. A vertex-to-vertex snake of unit triangles is called limited if it is not a proper subset of another vertex-to-vertex snake of unit triangles. We prove that the minimum number of unit triangles which form a limited vertex-to-vertex snake is seven. |
| |
| Keywords: | finite packings unit triangles snakes. |
| 本文献已被 SpringerLink 等数据库收录！ |
|
