arXiv Open Access 2017

Borel selector for hypergraphons

Jan Grebik

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

math.LO math.CO

Penulis (1)

Jan Grebik

Format Sitasi

APA MLA BibTeX

Grebik, J. (2017). Borel selector for hypergraphons. https://arxiv.org/abs/1712.04299

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓