On circles containing the maximum number of points
Let \(B(x,y)\) be the disk in the plane \(\mathbb{R}^2\) which has points \(x\), \(y\) as its diametral end points. And let \(\Pi^B(n)\) (or \(\Pi^B(n)\)) be the largest number such that for every set (or every convex set) \(P\) of \(n\) \((n \geq 2)\) points in \(\mathbb{R}^2\), there exist two points \(x, y \in P\) for which \(B(x,y)\) contains \(\Pi^B(n)\) (or \(\overline{\Pi}^B(n)\)) points of \(P\). In this note is proved that \(\Pi^B (n) = \overline{\Pi}^B(n) = \lceil n/3\rceil + 1\). This investigation is related to functions \(\Pi(n)\) and \(\overline{\Pi}(n)\) which are studied by \textit{V. Neumann-Lara} and \textit{J. Urrutia} [Discrete Math. 69, No. 2, 113-178 (1988; Zbl 0645.05024)] and \textit{R. Hayword} [Discrete Comput. Geom. 4, No. 3, 263-264 (1989; Zbl 0673.52008)].
- Point sets with many unit circles
- Some extremal results on circles containing points
- A note on the circle containment problem
- Finding a maximum set of independent chords in a circle
- On the number of circles determined by \(n\) points in the Euclidean plane
- On the number of points with pairwise integral distances on a circle
- On determining non-isotopic configurations of points on a circle
- Containment problems in high-dimensional spaces
- On circles enclosing many points
- Matching points with disks with a common intersection
- On covering a set of points by disks
- On the union complexity of diametral disks
- scientific article; zbMATH DE number 1786140 (Why is no real title available?)
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- On the number of ordinary circles determined by \(n\) points
- Some properties of k-Delaunay and k-Gabriel graphs
- On geodesic disks enclosing many points
This page was built for publication: On circles containing the maximum number of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916370)