A `converse' to the Constraint Lemma
Geometric Topology
2020-07-14 v3
Abstract
The main result is a direct proof of the implication below. Consider the following statements: () From any 11 points in one can choose 3 pairwise disjoint triples whose convex hulls have a common point. () From any points in one can choose 3 pairwise disjoint sets each containing points and whose convex hulls have a common point. () Any 7 points in can be decomposed into 3 subsets whose convex hulls have a common point. () Any points in can be decomposed into 3 subsets whose convex hulls have a common point. This statements are true, but the meaning of the article is the direct derivation of one statement from another.
Cite
@article{arxiv.1903.08910,
title = {A `converse' to the Constraint Lemma},
author = {Egor Kolpakov},
journal= {arXiv preprint arXiv:1903.08910},
year = {2020}
}