Hostname: page-component-848d4c4894-wzw2p Total loading time: 0 Render date: 2024-04-30T22:32:34.327Z Has data issue: false hasContentIssue false

Invariant colorings of random planar maps

Published online by Cambridge University Press:  22 April 2010

ÁDÁM TIMÁR*
Affiliation:
Hausdorff Center for Mathematics, Universität Bonn, D-53115 Bonn, Germany (email: adam.timar@hcm.uni-bonn.de)

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
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Angel, O., Benjamini, I., Gurel-Gurevich, O., Mayerovitch, T. and Peled, R.. Stationary map coloring. Preprint, 2008.Google Scholar
[2]Thomas, R.. An update on the four-color theorem. Notices Amer. Math. Soc. 45(7) (1998), 848859.Google Scholar
[3]Thomassen, C.. Five-coloring maps on surfaces. J. Combin. Theory Ser. B 59(1) (1993), 89105.CrossRefGoogle Scholar
[4]Timár, Á.. Tree and grid factors for general point processes. Electron. Comm. Probab. 9 (2004), 5359.CrossRefGoogle Scholar
[5]Timár, Á.. Invariant matchings of exponential tail on coin flips in ℤd. Preprint, 2008.Google Scholar