arXiv Analytics

Sign in

arXiv:2501.03645 [math.CO]AbstractReferencesReviewsResources

Convex polytopes with coplanarity

Koki Furukawa

Published 2025-01-07Version 1

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in convex position. In this papar, we give the upper and lower bounds for $ES_d(l,n)$.

Comments: 6 pages, 2 figures
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1509.01981 [math.CO] (Published 2015-09-07)
Drawing graphs with vertices and edges in convex position
arXiv:0911.4982 [math.CO] (Published 2009-11-25)
More bounds on the diameters of convex polytopes
arXiv:1705.03638 [math.CO] (Published 2017-05-10)
Shuffles of trees