2 papers
math.CO2026
The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
Jun Ge, Yamin Yu
Recently, Zheng and Wu defined the concept of odd spanning tree of a graph, meaning a spanning tree in which every vertex has odd degree. Similar to Cayley's formula, Feng, Chen an…
math.CO2026
On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
Wei Wang, Jun Ge
We present a determinantal formula for the number of spanning trees of a complete multipartite graph containing a given spanning forest . Our approach relies on the Generalized…