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…