A graph G has an even number of perfect matchings if and only if ∃S⊆V(G);(S≠ϕ) such that all vertices in V(G) are adjacent to an even number of vertices in S. At the moment, all I can see is just that finding determinant of A(G) over F2 reveals the parity of perfect matchings.

Moises Woods

Moises Woods

Answered question

2022-09-12

A graph G has an even number of perfect matchings if and only if S V ( G ) ; ( S ϕ ) such that all vertices in V ( G ) are adjacent to an even number of vertices in S.
At the moment, all I can see is just that finding determinant of A ( G ) over F 2 reveals the parity of perfect matchings.

Answer & Explanation

shosautesseleol

shosautesseleol

Beginner2022-09-13Added 16 answers

The answer can be found by regarding an element in the kernel of the adjacency matrix over F 2 , see the comments.
Note also that although the determinant of the adjacency matrix modulo 2 gives the parity of the number of matchings, it is not at all true that the determinant of the adjacency matrix can often be used to determine the number of matchings.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?