Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems

Kazuki Matoya, Taihei Oki

Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common…