A combinatorial result on points and circles on the plane (Q1102972): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Víctor Neumann-Lara / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Jorge Urrutia / rank | |||
Normal rank |
Revision as of 10:11, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A combinatorial result on points and circles on the plane |
scientific article |
Statements
A combinatorial result on points and circles on the plane (English)
0 references
1988
0 references
Let \(P_ n\) be a collection of n points on the plane. For a pair of points u and \(v\in P_ n\) let C(u,v) be the minimum number of points of \(P_ n\) contained in any circle containing u and v. In this paper we prove the result that there exist two points \(u_ 0\) and \(v_ 0\in P_ n\) such that any circle containing \(u_ 0\) and \(v_ 0\) contains at least \(\lceil (n-2)/60\rceil\) elements of \(P_ n\) (other than \(u_ 0\) and \(v_ 0)\). We also prove that the average value of C(u,v) over all pairs \(\{u,v\}\subset P_ nis\geq \lceil (n-2)/60\rceil.\) For the case when \(P_ n\) are the vertices of a convex polygon, we prove that there exist two vertices \(u,v\in P_ n\) such that any circle containing them contains at least \(\lceil (n-2)/4\rceil\) elements of \(P_ n\).
0 references
collection of n points on the plane
0 references
circle
0 references
convex polygon
0 references