Graphs which have an odd number of perfect matchings correspond to invertible matrices. Is this true? How?
Is there any theorem that relates the number of perfect matching in a non bipartite graph with its permanent?