Decomposition of Multiple Packings with Subquadratic Union Complexity

Pach, János and Walczak, B. (2016) Decomposition of Multiple Packings with Subquadratic Union Complexity. COMBINATORICS PROBABILITY & COMPUTING, 25 (1). pp. 145-153. ISSN 0963-5483

Preview

Text 1312.3215.pdf Download (305kB) | Preview

Abstract

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

Actions (login required)

Edit Item