arXiv · 1312.3215
Decomposition of multiple packings with subquadratic union complexity
Abstract
Suppose $k$ is a positive integer and $\mathcal{X}$ is a $k$-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most $k$ sets. Suppose there is a function $f(n)=o(n^2)$ with the property that any $n$ members of $\mathcal{X}$ determine at most $f(n)$ holes, which means that the complement of their union has at most $f(n)$ bounded connected components. We use tools from extremal graph theory and the topological Helly theorem to prove that $\mathcal{X}$ can be decomposed into at most $p$ ($1$-fold) packings, where $p$ is a constant depending only on $k$ and $f$.
Explore related subjects
Keep this discovery
János Pach, Bartosz Walczak. 2016-01-05. Decomposition of multiple packings with subquadratic union complexity. https://doi.org/10.1017/s0963548315000280
Cite the original work for its findings. Save a collection to share your selection of sources.