Abstract

In 1935 Pál Erdős and György Szekeres proved that, roughly speaking, any configuration of n points in general position in the plane have log n points in convex position — which are the vertices of a convex polygon. Later, in 1983, Bernhard Korte and László Lovász generalised this result in a purely combinatorial context; the context of greedoids. In this note we give one step further to generalise this last result for arbitrary dimensions, but in the context of separoids; thus, via the geometric representation theorem for separoids, this can be applied to families of convex bodies. Also, it is observed that the existence of some homomorphisms of separoids implies the existence of not-too-small polytopal subfamilies — where each body is separated from its relative complement. Finally, by means of a probabilistic argument, it is settled, basically, that for all d > 2 , asymptotically almost all “simple” families of n “ d - separated” convex bodies contains a polytopal subfamily of order log n d + 1 .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.