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 4 of 4 for “"container method"”.
-
On some problems in extremal, probabilistic and enumerative combinatorics
… ingredient to a very recently discovered proof method, called the Container method. Chapters 3 and 4 show various examples of this method in action. In Chapter 3 we, among others, give tight bounds on the logarithm of the number of $t$-error correcting codes and illustrate how the Container …
-
Enumerating combinatorial objects with limited sub-configurations
… problem, we introduce a new variant of the graph container algorithm. Another application of it to additive combinatorics is presented in Chapter 3 on generalized Sidon sets. In Chapter 4, we investigate an enumeration problem on Gallai colorings, i.e. rainbow triangle-free colorings. In …
-
A probabilistic perspective on graph coloring
… exponentially large families, applying the graph container method to study two coloring-adjacent questions: upper bounding the number of error correcting codes and understanding the structure of typical unit-distance avoiding sets in R².
-
Extremal properties of some random combinatorial systems
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-02-04 without embargo terms