This talk investigates the enumeration of spanning forests in complete graphs, where each tree contains a fixed set of vertices. We begin with an overview of how the Tree function (Lambert W function) can be used to count spanning forests with a single fixed vertex per tree. Building on this foundation, we demonstrate how this approach can be extended to more complex fixed vertex sets, potentially revealing broader implications of the method. (This work was done in collaboration with Daniel Pinzon and Daniel Pragel at GGC.)