Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Lovasz Local Lemma"”.
-
Coloring problems in combinatorics and descriptive set theory
… 1, we establish a generalization of the Lovász Local Lemma (a powerful tool in probabilistic combinatorics), which we call the Local Cut Lemma, and apply it to a variety of problems in graph coloring. In Chapter 2, we study DP-coloring (also known as correspondence coloring)—an extension of list …