Abstract: We define the Helly number of a polyomino as the smallest number such that the -Helly property holds for the family of symmetric and translated copies of on the integer grid. We prove the following: (i) the only polyominoes with Helly number 2 are the rectangles, (ii) there does not exist any polyomino with Helly number 3, (iii) there exist polyominoes of Helly number for any .
Recommendations
Cites work
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- A fractional Helly theorem for convex lattice sets
- Combinatorial Games
- Convexity in cristallographical lattices
- Counting polyominoes: yet another attack
- Edge intersection graphs of single bend paths on a grid
- The colorful Helly theorem and general hypergraphs
- The edge intersection graphs of paths in a tree
Cited in
(6)- scientific article; zbMATH DE number 1357398 (Why is no real title available?)
- scientific article; zbMATH DE number 2058433 (Why is no real title available?)
- On Helly numbers of exponential lattices
- Helly’s theorem: New variations and applications
- scientific article; zbMATH DE number 3893225 (Why is no real title available?)
- Hilbert series of simple thin polyominoes
This page was built for publication: Helly numbers of polyominoes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367067)