On the independence number of minimum distance graphs
- 64 Downloads
Let F=F(n) denote the largest number such that any set of n points in the plane with minimum distance 1 has at least F elements, no two of which are at unit distance. Improving a result by Pollack, we show that F(n) ≥ 9/35n. We also give an O(n log n) time algorithm for selecting at least 9/35n elements in a set of n points with minimum distance 1 so that no two selected points are at distance 1.
KeywordsMinimum Distance Discrete Comput Geom Common Neighbor Special Pair Independence Number
- 1.P. Erdős. Some combinatorial and metric problems in geometry, In: Intuitive Geometry, Colloquia Mathematica Societatis János Bolyai, vol. 48 (K. Böröczky and G. Fejes Tóth, Eds.), North-Holland, Amsterdam, pp. 167–177, 1985.Google Scholar