6 citations · 23 across the 15 of their papers we have counts for
Showing 2021 · math.COShow all
2 papers · 2 filters
math.CO2021★ 4 cited
The measurable Hall theorem fails for treeings
Gábor Kun
We construct, for every , a -regular acyclic measurably bipartite graphing that admits no measurable perfect matching, resolving a problem of Kechris and Marks. A dens…
math.CO2021★ 2 cited
Perfect matchings in hyperfinite graphings
Matthew Bowen, Gabor Kun, Marcin Sabok
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurab…