2 problems

For a game value $X$, let $f(X)$ be the minimum number of vertices in a digraph placement game having value $X$. For an integer $n\geq1$, let ${\ast n}$ denote the nimber of order…

Let $F(b)$ denote the largest number of vertices needed to construct a game value born by day $b$, and let $g(b)$ be the comparison function defined in the paper. Asymptotic sparsi…