Skip to main content

All Questions

Filter by
Sorted by
Tagged with
1 vote
0 answers
112 views

Is there a bipartite graph whose determinant corresponds to number of perfect matchings?

Let $M\in\{0,1\}^{n\times n}$ be a square integer matrix. If we consider $M$ as biadjacency of a balanced bipartite graph on $2n$ vertices having $n$ vertices of color $1$ and $n$ vertices of color $2$...
Turbo's user avatar
  • 13.9k