A note on a problem of Erdős on right angles (Q1045008): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2009.02.037 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2009.02.037 / rank | |||
Normal rank |
Latest revision as of 14:39, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on a problem of Erdős on right angles |
scientific article |
Statements
A note on a problem of Erdős on right angles (English)
0 references
15 December 2009
0 references
\textit{P. Erdős} [Problems and results in combinatorial analysis, in: Proc. 8th southeast. Conf. on Combinatorics, graph theory, and computing; Baton Rouge 1977, 3--12 (1977; Zbl 0416.05059)] asked the question whether it is true that a set of \(n^2\) points in the plane always contains \(2n-2\) points which do not determine a right angle. Erdős proved that there always exists a subset of \(cn^{2/3}\) points with this property. The author of the paper shows that, apart from a log-factor, the answer to Erdős' question is in the affirmative. Moreover, he proves that the same holds for any angle \(\beta\in (0, \pi)\) in place of \(90^\circ\).
0 references
plane
0 references
points
0 references
angle
0 references