The measurable Dilworth conjecture

Let P=(V,)P=(V,\preceq) be a measurable poset, meaning an ordered probability space with probabilistic measure μ\mu. Let GPG_P be its incomparability graph, and let χμ(GP)\chi_{\mu}(G_P) denote the measurable chromatic number of GPG_P. Measurable Dilworth conjecture. Every measurable poset PP of finite width kk is decomposable, up to a null set, into kk measurable chains. Equivalently,

χμ(GP)=k.\chi_{\mu}(G_P)=k.

This is a measurable analogue of the Borel Dilworth problem. The conjecture is motivated by the result that atomless measurable posets can be included in realistic measurable posets, but the general assertion remains open.

Sources & referencesView supporting material

Primary source

Bartłomiej Bosek, Jarosław Grytczuk and Zbigniew Lonc, “Dilworth's Theorem for Borel Posets”, arXiv:2004.02162 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.