We prove that octants are cover-decomposable into multiple coverings, i.e., for any k there is an m(k)m(k) such that any m(k)m(k)-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into k coverings. As a corollary, we obtain that any m(k)m(k)-fold covering of any subset of the plane with a finite number of homothetic copies of a given triangle can be decomposed into k coverings. Previously only some weaker bounds were known for related problems [20]
We prove that for any polygon S with at least four sides, and any k> 0, there is a k-fold coverin...
AbstractIn this paper, we extend the work on minimum coverings of Kn with triangles. We prove that w...
We shall show that every planar 4-fold covering of K_<3,3> can be decomposed into two planar 2-fold ...
$\newcommand{\R}{\mathbb{R}}$In this note we improve our upper bound given in [Keszegh and Pálvölgyi...
International audienceWe give new positive results on the long-standing open problem of geometric co...
A planar set P is said to be cover-decomposable if there is a constant k = k(P) such that every k-fo...
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago....
AbstractLet m(k) denote the smallest positive integer m such that any m-fold covering of the plane w...
We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold cov...
We study two decomposition problems in combinatorial geometry. The rst part of the thesis deals with...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
Let a tile be defined as a non-empty subset of the integers. The concept of decomposable coverings a...
[[abstract]]In this paper, we extend the work on minimum coverings of Kn with triangles. We prove th...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
We prove that for any polygon S with at least four sides, and any k> 0, there is a k-fold coverin...
AbstractIn this paper, we extend the work on minimum coverings of Kn with triangles. We prove that w...
We shall show that every planar 4-fold covering of K_<3,3> can be decomposed into two planar 2-fold ...
$\newcommand{\R}{\mathbb{R}}$In this note we improve our upper bound given in [Keszegh and Pálvölgyi...
International audienceWe give new positive results on the long-standing open problem of geometric co...
A planar set P is said to be cover-decomposable if there is a constant k = k(P) such that every k-fo...
The study of multiple coverings was initiated by Davenport and L. Fejes Tóth more than 50 years ago....
AbstractLet m(k) denote the smallest positive integer m such that any m-fold covering of the plane w...
We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold cov...
We study two decomposition problems in combinatorial geometry. The rst part of the thesis deals with...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of it...
Let a tile be defined as a non-empty subset of the integers. The concept of decomposable coverings a...
[[abstract]]In this paper, we extend the work on minimum coverings of Kn with triangles. We prove th...
A family of sets S = (S$ sb1$,S$ sb2$,...,S$ sb{m}$) is a k-fold cover for set T if each element of ...
We prove that for any polygon S with at least four sides, and any k> 0, there is a k-fold coverin...
AbstractIn this paper, we extend the work on minimum coverings of Kn with triangles. We prove that w...
We shall show that every planar 4-fold covering of K_<3,3> can be decomposed into two planar 2-fold ...