Borel selector for hypergraphons
Logic
2017-12-13 v1 Combinatorics
Abstract
We show that there is a Borel way of choosing a representative of a -uniform hypergraphon. This extends the result of Orbanz and Szegedy where this was shown for graphons.
Cite
@article{arxiv.1712.04299,
title = {Borel selector for hypergraphons},
author = {Jan Grebik},
journal= {arXiv preprint arXiv:1712.04299},
year = {2017}
}