English

On the hollow enclosed by convex sets

Combinatorics 2021-10-20 v2

Abstract

For ndn\leq d, a family F={C0,C1,,Cn}{\cal F}=\{C_0,C_1,\ldots, C_n\} of compact convex sets in RdR^d is called an nn-critical family provided any nn members of F{\cal F} have a non-empty intersection, but i=0nCi=\bigcap_{i=0}^n C_i=\varnothing. If n=dn=d then a lemma on the intersection of convex sets due to Klee implies that the d+1d+1 members of the dd-critical family enclose a `hollow' in RdR^d, a bounded connected component of Rdi=0nCi.R^d\setminus\bigcup_{i=0}^n C_i. Here we prove that the closure of the convex hull of a hollow in RdR^d is a dd-simplex.

Cite

@article{arxiv.2105.14306,
  title  = {On the hollow enclosed by convex sets},
  author = {Jenő Lehel and Géza Tóth},
  journal= {arXiv preprint arXiv:2105.14306},
  year   = {2021}
}

Comments

7 pages. Identical to original version, just some new acknowledgements

R2 v1 2026-06-24T02:36:02.857Z