Helly Numbers of Polyominoes

08/21/2017
by   Jean Cardinal, et al.
0

We define the Helly number of a polyomino P as the smallest number h such that the h-Helly property holds for the family of symmetric and translated copies of P 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 k for any k≠ 1,3.

READ FULL TEXT
research
09/02/2021

Ramsey Numbers of Trails

We initiate the study of Ramsey numbers of trails. Let k ≥ 2 be a positi...
research
07/28/2022

Folding Polyiamonds into Octahedra

We study polyiamonds (polygons arising from the triangular grid) that fo...
research
05/24/2023

Preliminary investigations on induction over real numbers

The induction principle for natural numbers expresses that when a proper...
research
10/30/2018

The 2-domination and Roman domination numbers of grid graphs

We investigate the 2-domination number for grid graphs, that is the size...
research
07/19/2019

An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)

Let p(n) denote the smallest prime divisor of the integer n. Define the ...
research
01/31/2023

Exploring Wedges of an Oriented Grid by an Automaton with Pebbles

A mobile agent, modeled as a deterministic finite automaton, navigates i...

Please sign up or login with your details

Forgot password? Click here to reset