Related papers: Unsplittable coverings in the plane

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…

We say that a finite set of red and blue points in the plane in general position can be $K_{1,3}$-covered if the set can be partitioned into subsets of size $4$, with $3$ points of one color and $1$ point of the other color, in such a way…

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

We say that a simple, closed curve $\gamma$ in the plane has bounded convex curvature if for every point $x$ on $\gamma$, there is an open unit disk $U_x$ and $\varepsilon_x>0$ such that $x\in\partial U_x$ and $B_{\varepsilon_x}(x)\cap…

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…

The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…

Let $S$ be a 2-colored (red and blue) set of $n$ points in the plane. A subset $I$ of $S$ is an island if there exits a convex set $C$ such that $I=C\cap S$. The discrepancy of an island is the absolute value of the number of red minus the…

We consider collections of hyperplanes in $\mathbb{R}^n$ covering all vertices of the $n$-dimensional hypercube $\{0,1\}^n$, which satisfy the following nondegeneracy condition: For every $v\in \{0,1\}^n$ and every $i=1,\dots,n$, we demand…

We prove that the countable product of supercomplete spaces having a countable closed cover consisting of partition-complete subspaces is supercomplete with respect to its metric-fine coreflection. Thus, countable products of…

We prove that for each fixed $m \ge 2$, there are only finitely many disjoint covering systems with minimum modulus at least $3$ in which precisely one modulus is repeated, namely the largest modulus, and it occurs exactly $m$ times.

We show that the minimal number of skewed hyperplanes that cover the hypercube $\{0,1\}^{n}$ is at least $\frac{n}{2}+1$, and there are infinitely many $n$'s when the hypercube can be covered with $n-\log_{2}(n)+1$ skewed hyperplanes. The…

We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a…

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

In FOCS 2002, Even et al. showed that any set of $n$ discs in the plane can be Conflict-Free colored with a total of at most $O(\log n)$ colors. That is, it can be colored with $O(\log n)$ colors such that for any (covered) point $p$ there…

We show that a $k$-fold covering using translates of an arbitrary convex polygon can be decomposed into $\Omega(k)$ covers (using an efficient algorithm). We generalize this result to obtain a constant factor approximation to the sensor…

An affine manifold is a manifold with an affine structure, i.e. a torsion-free flat affine connection. We show that the universal cover of a closed affine 3-manifold $M$ with holonomy group of shrinkable dimension (or discompacit\'e in…

We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs,…