Intersection patterns of planar sets
Let A={A1,…,An} be a family of sets in the plane. For 0≤i<n, denote by fi the number of subsets σ of {1,…,n} of cardinality i+1 that satisfy ⋂i∈σAi≠∅. Let k≥2 be an integer. We prove that if each k-wise and (k+1)-wise intersection of sets from A is empty, or a single point, or both open and path-connected, then fk+1=0 implies fk≤cfk−1 for some positive constant c depending only on k. Similarly, let b≥2, k>2b be integers. We prove that if each k-wise or (k+1)-wise intersection of sets from A has at most b path-connected components, which all are open, then fk+1=0 implies fk≤cfk−1 for some positive constant c depending only on b and k. These results also extend to two-dimensional compact surfaces.
64
304-323
304-323
Springer Nature