当前位置: X-MOL 学术Discret. Comput. Geom. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A One-Page Solution of a Problem of Erdős and Purdy
Discrete & Computational Geometry ( IF 0.8 ) Pub Date : 2019-10-16 , DOI: 10.1007/s00454-019-00139-1
Rom Pinchasi , Alexandr Polyanskii

The following theorem was conjectured by Erdős and Purdy: Let P be a set of $$n>4$$ points in general position in the plane. Suppose that R is a set of points disjoint from P such that every line determined by P passes through a point in R. Then $$|R| \ge n$$ . In this paper we give a very elegant and elementary proof of this, being a very good candidate for the “book proof” of this conjecture.

中文翻译:

Erdős 和 Purdy 问题的一页解决方案

Erdős 和 Purdy 推测了以下定理:设 P 是平面中一般位置的 $$n>4$$ 点的集合。假设 R 是一组与 P 不相交的点,使得由 P 确定的每条线都经过 R 中的一个点。然后 $$|R| \ge n$$ 。在这篇论文中,我们给出了一个非常优雅和基本的证明,是这个猜想的“书本证明”的一个很好的候选者。
更新日期:2019-10-16
down
wechat
bug