Smallest limited snakes (Q951276)

Two disks are said to overlap if they have a common interior point. A snake is a sequence \(\langle C_{1},\dots,C_{n} \rangle\) of mutually non-overlapping congruent disks, where \(C_{i} \cap C_{j} \neq \emptyset\) if and only if \(| i-j| \leq 1\). The paper deals with proving the following Theorem: ``The minimum number of mutually non-overlapping congruent disks which can form a limited snake is four''.