Intersection properties of families of convex \((n,d)\)-bodies (Q1283772)

A family of bodies is called intersecting if its members have a nonempty intersection. Helly's theorem claims that a finite family \(\mathcal F\) of convex bodies in \(\mathbb R^d\) is intersecting iff every subfamily \(\mathcal F'\subseteq F\) of size \(d + 1\) is intersecting. Over the years many different generalizations of this theorem have appeared. The authors study a multicomponent generalization of Helly's theorem. An \((n, d)\)-body \(K\) is an ordered \(n\)-tuple of \(d\)-dimensional sets, \(K = (K_1,\dots, K_n).\) A family \(\mathcal F\) of \((n,d)\)-bodies is weakly intersecting if there exists an \(n\)-point \((p_1,\dots,p_n)\) such that for every \(K \in\mathcal F\) there exists an index \(i\), \(1 \leq i\leq n,\) for which \(p_i\in K_i.\) A family \(\mathcal F\) of \((n,d)\)-bodies is strongly intersecting if there exists an index \(i\) such that \(\cap_{K\in\mathcal F} K_i\neq \varnothing.\) The main question addressed in this paper is: What is the smallest number \(H(n. d),\) such that for every finite family of convex \((n, d)\)-bodies, if every \(H(n.d)\) of them are strongly intersecting, then the entire family is weakly intersecting? The authors establish some basic facts about \(H(n,d),\) and also prove an upper bound \(H(n, d)\leq ([\log_2(n+ 1)]+1)^d.\) In addition, the authors introduce and partially answer two related questions of a combinatorial-topological nature concerning the structure of the nerve of certain open covers of polytopes.