#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

Even Subgraphs - Math Problems | Repovive

MATH2. Even Subgraphs Beta

Let $G$ be a connected graph with $n$ vertices and $m$ edges. Prove that the number of subsets $S$ of the edges of $G$ such that every vertex of $G$ has even degree in the subgraph $(V(G), S)$ is exactly $2^{m-n+1}$ .

Proof

You can write formulas in LaTeX or in plain text, and write your solution in any language.