Colorings of Randomly Augmented Graphs and a Maker-Strategy for the k-Edge-Connectivity Game

In this thesis the behavior of two graph properties on randomly augmented
graphs are studied, as well as multiple Maker-Breaker games. It contains tight upper bounds for the chromatic number and the choice number of randomly augmented graphs. Furthermore it gives an upper bound for the number of turns it takes Maker to win several Maker-Breaker games.

Rights

Use and reproduction:


CC BY 4.0

Please note that individual components of the publication may be subject to other licensing or copyright conditions.

Cite

Citation style:
Could not load citation form.