Borel selector for hypergraphons
classification
🧮 math.LO
math.CO
keywords
borelchoosingextendsgraphonshypergraphonhypergraphonsorbanzrepresentative
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.