Probability Seminar
Nov
16
2026
Nov
16
2026
Description
Measurable perfect matchings have been intensively studied in the last decade thanks to Tarski’s circle squaring problem. The notion of hyperfinitess originates in ergodic theory. Hyperfinite graphings are the natural limits of sequences of sparse finite graphs with small expansion. They play an important role from probability to property testing. Known examples of hyperfinite graphings with the Hall condition but without a measurable perfect matching have two-ended components (i.e., of linear growth). We characterized with Bowen and Sabok hyperfinite graphings without measurable perfect matchings via such obstructions. I explain this characterization, the basic ideas of its proof and give applications from the measurable circle squaring to the amenable Lyons-Nazarov theorem.