相关论文: On the number of points in general position in the…

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

Given a collection of points in the plane, classifying which subsets are collinear is a natural problem and is related to classical geometric constructions. We consider collections of points in a projective plane over a finite field such…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

Given $n$ points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least $n/2$ segments, and $n-1$ straight line segments obviously suffice…

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…

A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

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$,…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…