The measurable Hall theorem fails for treeings
The measurable Hall theorem fails for treeings
复制标题
可测霍尔定理对于树来说失败
DOI:
--
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
G. Kun
中科院分区:
文献类型:
--
作者:
G. Kun
We construct for every d ≥ 2 a d-regular acyclic measurably bipartite graphing that admits no measurable perfect matching. This answers a question of Kechris and Marks.