相关论文: Point Sets with Small Integer Coordinates and with…

In 1978 Erd\H os asked if every sufficiently large set of points in general position in the plane contains the vertices of a convex $k$-gon, with the additional property that no other point of the set lies in its interior. Shortly after,…

Let $ES_{d}(n)$ be the smallest integer such that any set of $ES_{d}(n)$ points in $\mathbb{R}^{d}$ in general position contains $n$ points in convex position. In 1960, Erd\H{o}s and Szekeres showed that $ES_{2}(n) \geq 2^{n-2} + 1$ holds,…

Let $ES(n)$ be the smallest integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. In their seminal 1935 paper, Erdos and Szekeres showed that $ES(n) \leq {2n - 4\choose n-2} + 1…

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

According to the Erd\H{o}s-Szekeres theorem, for every $n$, a sufficiently large set of points in general position in the plane contains $n$ in convex position. In this note we investigate the line version of this result, that is, we want…

According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…

We study the order dimension of the lattice of closed sets for a convex geometry. Further, we prove the existence of large convex geometries realized by planar point sets that have very low order dimension. We show that the planar point set…

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

In 2001, K\'arolyi, Pach and T\'oth introduced a family of point sets to solve an Erd\H{o}s-Szekeres type problem; which have been used to solve several other Ed\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested…

Let $S$ be a set of $n$ points in general position in the plane, and let $X_{k,\ell}(S)$ be the number of convex $k$-gons with vertices in $S$ that have exactly $\ell$ points of $S$ in their interior. We prove several equalities for the…

Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…

Let $ES(n)$ denote the minimum natural number such that every set of $ES(n)$ points in general position in the plane contains $n$ points in convex position. In 1935, Erd\H{o}s and Szekeres proved that $ES(n) \le {2n-4 \choose n-2}+1$. In…

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

We consider point sets in the real projective plane $\mathbb{R}P^2$ and explore variants of classical extremal problems about planar point sets in this setting, with a main focus on Erd\H{o}s--Szekeres-type problems. We provide…

Let $ES(n)$ be the minimal integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. The problem of estimating $ES(n)$ was first formulated by Erd\H{o}s and Szekeres, who proved…

Two elements, $x$ and $y$, are separated by a set $S$ if it contains exactly one of $x$ and $y$. We prove that any set of $n$ points in general position in the plane can be separated by $O(n\log\log n/\log n)$ convex sets, and for some…

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…