2 problems

Let $K_n$ be the complete graph on $n$ vertices. In the $(1:1)$ Client–Waiter game, Waiter offers two board elements at each round and Client claims one; Client's claimed edges for…

Let $K_n$ be the complete graph on $n$ vertices. A graph is tree-universal at degree bound $D$ if it contains a copy of every tree $T$ with $n$ vertices and maximum degree…