Helly numbers of polyominoes
From MaRDI portal
Publication:367067
DOI10.1007/S00373-012-1203-XzbMATH Open1272.05024arXiv1708.06063OpenAlexW2004384500MaRDI QIDQ367067FDOQ367067
Authors: Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1708.06063
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The edge intersection graphs of paths in a tree
- Edge intersection graphs of single bend paths on a grid
- Convexity in cristallographical lattices
- Title not available (Why is that?)
- Counting polyominoes: yet another attack
- A fractional Helly theorem for convex lattice sets
- The colorful Helly theorem and general hypergraphs
- Combinatorial Games
Cited In (6)
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)