solidot新版网站常见问题，请点击这里查看。
消息
本文已被查看3342次
Borel selector for hypergraphons. (arXiv:1712.04299v1 [math.LO])
来源于:arXiv
We show that there is a Borel way of choosing a representative of a
$k$-uniform hypergraphon. This extends the result of Orbanz and Szegedy where
this was shown for graphons. 查看全文>>
