Creating spanning trees in Waiter-Client games

Grzegorz Adamski, Sylwia Antoniuk, Małgorzata Bednarska-Bzdęga +3

For a positive integer $n$ and a tree $T_n$ on $n$ vertices, we consider an unbiased Waiter-Client game $\text{WC}(n,T_n)$ played on the complete graph~$K_n$, in which Waiter's g…