Borel selector for hypergraphons

12 Dec 2017  ·  Grebik Jan ·

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...

PDF Abstract
No code implementations yet. Submit your code now

Categories


Logic Combinatorics