Measurable domatic partitions
Edward Hou
TL;DR
This work analyzes when Schreier graphs $\mathrm{Sch}(\Gamma,S,\Gamma)$ arising from finite-dimensional compact Polish groups admit measurable domatic partitions of countably many colors. It develops a framework combining open-cells packing, Gleason–Yamabe dimension theory, and probabilistic tools (Lovász Local Lemma) to construct domatic partitions with open, Borel, or Haar-measurable parts and to lift finite partitions to $\aleph_0$-partitions when $\overline{S}$ is uncountable. Key results include the equivalence of the existence of continuous (and Baire) $\aleph_0$-domatic partitions with the uncountability of $\overline{S}$ for finite-dimensional $\Gamma$, and the universal existence of Haar-measurable domatic partitions for all $S$, along with sum-set applications. The paper further extends these ideas to broader descriptive graph settings, providing both positive constructions and negative results that illuminate the limits and scope of domatic partitions in Borel, Baire, and measure-theoretic contexts.
Abstract
Let $Γ$ be a compact Polish group of finite topological dimension. For a countably infinite subset $S\subseteq Γ$, a domatic $\aleph_0$-partition (for its Schreier graph on $Γ$) is a partial function $f:Γ\rightharpoonup\mathbb{N}$ such that for every $x\in Γ$, one has $f[S\cdot x]=\mathbb{N}$. We show that a continuous domatic $\aleph_0$-partition exists, if and only if a Baire measurable domatic $\aleph_0$-partition exists, if and only if the topological closure of $S$ is uncountable. A Haar measurable domatic $\aleph_0$-partition exists for all choices of $S$. We also investigate domatic partitions in the general descriptive graph combinatorial setting.
