Abstract
A question of the following kind will concern us here: what is the minimal numbern, ensuring that any spanning set ofn points in 3-space spans a plane, every open side of which contains at least, say, 1000 points of the set. The answer isn=4001 (see Theorem 2.1 below).
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
