Showing 2017 · math.LOShow all
2 papers · 2 filters
math.LO2017
Borel selector for hypergraphons
Jan Grebik
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.
math.LO2017
Bases and selectors for tall families
Jan Grebik, Carlos Uzcategui
We show that the Nash-Williams theorem has a uniform version and that the Galvin theorem does not. We show that there is an tall ideal on without a Borel selecto…