stylistic:style_transfer
Handshaking lemma

The degree sum formula states that, given a graph G = (V, E) {\displaystyle G=(V,E)},

The formula implies that in any undirected graph, the number of vertices with odd degree is even. This statement (as well as the degree sum formula) is known as the handshaking lemma. The latter name comes from a popular mathematical problem, which is to prove that in any group of people, the number of people who have shaken hands with an odd number of other people from the group is even.