Skip to main content Accessibility help
×
Home

BROOKS’ THEOREM FOR MEASURABLE COLORINGS

  • CLINTON T. CONLEY (a1), ANDREW S. MARKS (a2) and ROBIN D. TUCKER-DROB (a3)

Abstract

We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $X$ of degree bounded by $d\geqslant 3$ which contains no $(d+1)$ -cliques, then $G$ admits a ${\it\mu}$ -measurable $d$ -coloring with respect to any Borel probability measure ${\it\mu}$ on $X$ , and a Baire measurable $d$ -coloring with respect to any compatible Polish topology on $X$ . The proof of this theorem uses a new technique for constructing one-ended spanning subforests of Borel graphs, as well as ideas from the study of list colorings. We apply the theorem to graphs arising from group actions to obtain factor of IID $d$ -colorings of Cayley graphs of degree $d$ , except in two exceptional cases.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      BROOKS’ THEOREM FOR MEASURABLE COLORINGS
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      BROOKS’ THEOREM FOR MEASURABLE COLORINGS
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      BROOKS’ THEOREM FOR MEASURABLE COLORINGS
      Available formats
      ×

Copyright

This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.

References

Hide All
[1] Aldous, D. and Lyons, R., ‘Processes on unimodular random networks’, Electron. J. Probab. 12 (2007), 14541508.
[2] Benjamini, I., Lyons, R., Peres, Y. and Schramm, O., ‘Critical percolation on any nonamenable group has no infinite clusters’, Ann. Probab. 27(3) (1999), 13471356.
[3] Benjamini, I., Lyons, R., Peres, Y. and Schramm, O., ‘Uniform spanning forests’, Ann. Probab. 29(1) (2001), 165.
[4] Borodin, O. V., ‘Criterion of chromaticity of a degree prescription (in Russian)’, inAbstracts of IV All-Union Conference on Theoretical Cybernetics (Novosibirsk) (1977), 127128.
[5] Conley, C. T. and Kechris, A. S., ‘Measurable chromatic and independence numbers for ergodic graphs and group actions’, Groups Geom. Dyn. 7(1) (2013), 127180.
[6] Conley, C. T., Kechris, A. S. and Tucker-Drob, R. D., ‘Ultraproducts of measure preserving actions and graph combinatorics’, Ergod. Th. & Dynam. Sys. 33(2) (2013), 334374.
[7] Conley, C. T. and Miller, B. D., ‘A bound on measurable chromatic numbers of locally finite Borel graphs’, Math. Res. Lett., to appear.
[8] Cranston, D. W. and Rabern, L., ‘Brooks’ theorem and beyond’, J. Graph Theory 80(3) (2014), doi:10.1002/jgt.21847.
[9] Diestel, R., Graph Theory, Graduate Texts in Mathematics, 173 (Springer, Berlin, 2005).
[10] Erdős, P., Rubin, A. and Taylor, H., ‘Choosability in graphs’, inProceedings of West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979), Congressus Numerantium, 26 (1979), 125157.
[11] Gaboriau, D. and Lyons, R., ‘A measurable-group-theoretic solution to von Neumann’s problem’, Invent. Math. 177(3) (2009), 533540.
[12] Hjorth, G. and Miller, B. D., ‘Ends of graphed equivalence relations II’, Israel J. Math. 169(3) (2009), 393415.
[13] Jackson, S., Kechris, A. S. and Louveau, A., ‘Countable Borel equivalence relations’, J. Math. Log. 2(1) (2002), 180.
[14] Kechris, A. S., Classical Descriptive Set Theory, Graduate Texts in Mathematics, 156 (Springer, New York, 1995).
[15] Kechris, A. S. and Miller, B. D., Topics in Orbit Equivalence, Lecture Notes in Mathematics, 1852 (Springer, Berlin, 2004).
[16] Kechris, A. S., Solecki, S. and Todorcevic, S., ‘Borel chromatic numbers’, Adv. Math. 141(1) (1999), 144.
[17] Lyons, R. and Nazarov, F., ‘Perfect matchings as IID factors on non-amenable groups’, European J. Combin. 32(7) (2011), 11151125.
[18] Lyons, R., Peres, Y. and Schramm, O., ‘Minimal spanning forests’, Ann. Probab. 34(5) (2006), 16651692.
[19] Marks, A., ‘A determinacy approach to Borel combinatorics’, J. Amer. Math. Soc. 29(2) (2016), 579600.
[20] Miller, B. D., ‘Ends of graphed equivalence relations I’, Israel J. Math. 169 (2009), 365392.
[21] Miller, B. D., ‘The graph-theoretic approach to descriptive set theory’, Bull. Symbolic Logic (2012), 554575.
[22] Pemantle, R., ‘Towards a theory of negative dependence’, J. Math. Phys. 41(3) (2002), 13711390.
[23] Zakrzewski, P., ‘On invariant ccc 𝜎-ideals on 2 ’, Acta Math. Hungar. 143(2) (2014), 367377.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

BROOKS’ THEOREM FOR MEASURABLE COLORINGS

  • CLINTON T. CONLEY (a1), ANDREW S. MARKS (a2) and ROBIN D. TUCKER-DROB (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed