1 problem

For each $n\geq 0$, let $G_n$ be an acyclic graph on $n$ vertices, and write ${G_n \brace k}$ for the number of partitions of the vertex set of $G_n$ into $k$ non-empty independent…