---
res:
bibo_abstract:
- Let A={A1,…,An} be a family of sets in the plane. For 0≤i2b 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Gil
foaf_name: Kalai, Gil
foaf_surname: Kalai
- foaf_Person:
foaf_givenName: Zuzana
foaf_name: Patakova, Zuzana
foaf_surname: Patakova
foaf_workInfoHomepage: http://www.librecat.org/personId=48B57058-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-3975-1683
bibo_doi: 10.1007/s00454-020-00205-z
bibo_volume: 64
dct_date: 2020^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/01795376
- http://id.crossref.org/issn/14320444
dct_language: eng
dct_publisher: Springer Nature@
dct_title: Intersection patterns of planar sets@
...