2 problems

Let $k\geq 3$ be an integer, let $G$ be a graph, and for a vertex set $X\subseteq V(G)$ let $c_{2j+1}(G-X)$ denote the number of components of $G-X$ having order $2j+1$. A {…

Let $K_n$ be the complete graph on $n$ vertices, and let $\mathcal L(n,q)$ denote the largest component size that Waiter can force in Client's graph when playing a $(q:1)$ Waiter–C…