puck.rombach

The 2-rank of the adjacency matrix of a graph is always even. There are various proofs for this; see, for example, Chapter 8 in [1], where this is shown as part of a larger theorem. However, while teaching a class I noticed the following simple proof. Claim: Let G be a simple n-vertex graph. Then…