Bipartite Handshake Lemma

Let where are its vertex set. Then,

Proof:

We know that each edge in a bipartite graph connects a vertex in to . Thus, for each edge it has one endpoint in . But then as counts the edges with endpoints in , then

Likewise, as each edge has an endpoint in ,

and so

Related: Handshake Lemma, Face Handshake Lemma.