Article contents
Invariant colorings of random planar maps
Published online by Cambridge University Press: 22 April 2010
Abstract
We show that every locally finite random graph embedded in the plane with an isometry-invariant distribution can be five-colored in an invariant and deterministic way, under some non-triviality assumption and a mild assumption on the tail of edge lengths. The assumptions hold for any Voronoi map on a point process that has no non-trivial symmetries almost surely, hence we improve and generalize previous results on six-coloring the Voronoi map on a Poisson point process (see Angel, Benjamini, Gurel-Gurevich, Mayerovitch and Peled [Stationary map coloring. Preprint, 2008]).
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 2010
References
- 3
- Cited by