Measurable matchings in unbalanced graphs

Abstract

Let $G$ be a locally finite multigraph that is bipartite and "unbalanced," meaning that it has a nontrivial bipartition $(A,B)$ with $\mathrm{deg}(x) > \mathrm{deg}(y)$ for all $x \in A$ and $y \in B$. We explore matchings in such graphs through the lens of descriptive set theory. In particular, we show that when $G$ is Borel and $μ$ is a Borel probability measure on its vertex set, there is a Borel matching in $G$ that covers $μ$-almost every vertex in $A$. This was previously known only under the assumption that $μ$ is $G$-invariant, which we eliminate using a novel probabilistic approach. We also describe various extra conditions that imply the existence of a Borel matching covering every vertex in $A$. Along the way, we confirm a conjecture of the first and third named authors concerning the existence of Borel independent complete sections in Borel graphs of finite asymptotic separation index. In addition to their intrinsic interest, our results have applications to various other topics, such as edge-colorings, balanced orientations, and equidecomposition theory for group actions. For example, we show that the measurable edge-chromatic number of every Borel multigraph with finite maximum degree $Δ$ is at most $\lfloor\frac{3Δ}{2}\rfloor$, matching Shannon's optimal bound for finite multigraphs. Another example is that paradoxical Borel group actions with finite asymptotic separation index admit paradoxical decompositions with Borel pieces. This refines a result of Marks and Unger.