Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- 4 November 2008
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 34 (1) , 11-23
Abstract
Given a point set P in the plane, the Delaunay graph with respect to axis‐parallel rectangles is a graph defined on the vertex set P, whose two points p,q ∈ P are connected by an edge if and only if there is a rectangle parallel to the coordinate axes that contains p and q, but no other elements of P. The following question of Even et al. (SIAM J Comput 33 (2003) 94–136) was motivated by a frequency assignment problem in cellular telephone networks: Does there exist a constant c > 0 such that the Delaunay graph of any set of n points in general position in the plane contains an independent set of size at least cn? We answer this question in the negative, by proving that the largest independent set in a randomly and uniformly selected point set in the unit square is O(nlog 2 log n/log n), with probability tending to 1. We also show that our bound is not far from optimal, as the Delaunay graph of a uniform random set of n points almost surely has an independent set of size at least cn log log n/(log n log log log n).We give two further applications of our methods: (1) We construct two‐dimensional n‐element partially ordered sets such that the size of the largest independent sets of vertices in their Hasse diagrams is o(n). This answers a question of Matoušek and Přívětivý (Combinat Probab Comput 15 (2006) 473–475) and improves a result of Kříž and Nešetřil (Order 8 (1991) 41–48). (2) For any positive integers c and d, we prove the existence of a planar point set with the property that no matter how we color its elements by c colors, we find an axis‐parallel rectangle containing at least d points, all of which have the same color. This solves an old problem from the work of Brass et al. (Research Problem in Discrete Geometry Springer‐Verlag, New York, 2005). © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009Keywords
This publication has 20 references indexed in Scilit:
- On The Chromatic Number of Geometric HypergraphsSIAM Journal on Discrete Mathematics, 2007
- Online Conflict‐Free Coloring for IntervalsSIAM Journal on Computing, 2007
- Conflict-Free Coloring of Points and Simple Regions in the PlaneDiscrete & Computational Geometry, 2005
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular NetworksSIAM Journal on Computing, 2003
- On the independence number of sparse graphsRandom Structures & Algorithms, 1995
- Relative neighborhood graphs and their relativesProceedings of the IEEE, 1992
- Computational geometry algorithms for the systolic screenAlgorithmica, 1991
- Fast algorithms for direct enclosures and direct dominancesJournal of Algorithms, 1989
- On rectangular visibilityJournal of Algorithms, 1988
- Turán's theorem for k-graphsDiscrete Mathematics, 1972