Equitable Colorings of Borel Graphs
Anton Bernshteyn, Clinton T. Conley

TL;DR
This paper extends equitable coloring results from finite graphs to infinite Borel graphs, establishing Borel and measurable equitable colorings under various conditions, including invariance and degree constraints.
Contribution
It introduces Borel and measurable equitable coloring theorems for infinite graphs, generalizing classical finite graph results to the Borel setting.
Findings
Borel proper $k$-colorings exist for aperiodic Borel graphs with degree $ riangle$ when $k extgreater riangle$
Measurable equitable $ riangle$-colorings exist for graphs with small average degree and no $( riangle+1)$-cliques
Extensions of Brooks's theorem for measurable and list coloring are established
Abstract
Hajnal and Szemer\'{e}di proved that if is a finite graph with maximum degree , then for every integer , has a proper coloring with colors in which every two color classes differ in size at most by ; such colorings are called equitable. We obtain an analog of this result for infinite graphs in the Borel setting. Specifically, we show that if is an aperiodic Borel graph of finite maximum degree , then for each , has a Borel proper -coloring in which every two color classes are related by an element of the Borel full semigroup of . In particular, such colorings are equitable with respect to every -invariant probability measure. We also establish a measurable version of a result of Kostochka and Nakprasit on equitable -colorings of graphs with small average degree. Namely, we prove that if…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Limits and Structures in Graph Theory · Advanced Graph Theory Research
