We prove that for a finitely generated infinite nilpotent group $G$ with structure $(G,\cdot,\dots)$, the connected component ${G^*}^0$ of a sufficiently saturated extension $G^*$ of $G$ exists and equals \[ \bigcap_{n\in\N} \{g^n\colon g\in G^*\}. \] We construct an expansion of ${\mathbb Z}$ by a predicate $({\mathbb Z},+,P)$ such that the type-connected component ${{\mathbb Z}^*}^{00}_{\emptyset}$ is strictly smaller than ${{\mathbb Z}^*}^0$. We generalize this to finitely generated virtually solvable groups. As a corollary of our construction we obtain an optimality result for (...) the van der Waerden theorem for finite partitions of groups. (shrink)

We investigate Maker–Breaker games on graphs of size $\aleph _1$ in which Maker’s goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the game on the axiomatic framework. Relating to this, we prove that there is a winning strategy for Maker in the $K_{\omega,\omega _1}$ -game under ZFC+MA+ $\neg $ CH and a winning strategy for Breaker under ZFC+CH. We prove a similar result for the $K_{\omega _1}$ -game. Here, Maker (...) has a winning strategy under ZF+DC+AD, while Breaker has one under ZFC+CH again. (shrink)