Return to search

Definovatelne grafy / Definable graphs

In this thesis we consider various questions and problems about graphs that appear in the framework of descriptive set theory. The main object of study are graphons, graphings and variations of the graph G0. We establish an approach to the compactness of the graphon space via the weak* topology and introduce the notion of a fractional isomorphism for graphons. We use a variant of the G0-dichotomy in the context of the classification problem. Finally, we show a measurable version of the Vizing's theorem for graphings. 1

Identiferoai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:437544
Date January 2020
CreatorsGrebík, Jan
ContributorsChodounský, David, Kurka, Ondřej, Zapletal, Jindřich
Source SetsCzech ETDs
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/doctoralThesis
Rightsinfo:eu-repo/semantics/restrictedAccess

Page generated in 0.0024 seconds