Smallest limited snakes

DOI10.4171/EM/62MaRDI QIDQ951276zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 23 October 2008

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/em/62

zbMATH Keywords

non-overlapping diskssnake

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1933237
• scientific article; zbMATH DE number 1472108
• scientific article; zbMATH DE number 1498834
• Smallest limited snakes in d-grids
• scientific article; zbMATH DE number 1743767
• A smaller sleeping bag for a baby snake
• On the smallest limited snake of unit disks
• scientific article; zbMATH DE number 21365
• Smallest limited vertex-to-vertex snakes of unit triangles
• Small snarks with large oddness

Cites work

• scientific article; zbMATH DE number 1743767 (Why is no real title available?)
• On the smallest limited snake of unit disks
• Proof of a conjecture of Heiko Harborth on polyominoes of squares
• Smallest limited vertex-to-vertex snakes of unit triangles
• Smallest maximal snakes of translates of convex domains

Cited in

(3)

• On the smallest limited snake of unit disks
• What is the minimum length of a non-extendable lace?
• Smallest maximal snakes of translates of convex domains

This page was built for publication: Smallest limited snakes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951276)