Decomposition of Multiple Packings with Subquadratic Union Complexity

Suppose k is a positive integer and 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 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 X can be decomposed into at most p (1-fold) packings, where p is a constant depending only on k and f.


Published in:
Combinatorics Probability & Computing, 25, 1, 145-153
Year:
2016
Publisher:
New York, Cambridge Univ Press
ISSN:
0963-5483
Laboratories:




 Record created 2016-02-16, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)