Distributed algorithms, the Lovász Local Lemma, and descriptive combinatorics

In this paper we consider coloring problems on graphs and other combinatorial structures on standard Borel spaces. Our goal is to obtain sufficient conditions under which such colorings can be made well-behaved in the sense of topology or measure. To this end, we show that such well-behaved coloring...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Inventiones mathematicae 2023-08, Vol.233 (2), p.495-542
1. Verfasser:	Bernshteyn, Anton
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Coloring Combinatorial analysis Combinatorics Computer science Graph coloring Graphs Mathematics Mathematics and Statistics Topology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!