From Wiki Page of Degree (graph theory), we have
"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, 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."
Can we also say that,
in any group of people, the number of people who have shaken hands with an EVEN number of other people from the group is even."
This statement may seem obvious ?
So is it basically saying that: with an even number of people who have shaken hands, then number of people is is even in any group of people. (Understand it is a bit mouthful, is there any other more elegant way saying it besides Wiki Page and my own interpretation).
Q1: So it doesn't matter whether the number of people who have shaken hands is EVEN or ODD within any group, the number of people is even ?
Then trying to a better understanding from the Wiki Page of (Handshaking lemma). Then got confused by
In more colloquial terms, in a party of people some of whom shake hands, an even number of people must have shaken an odd number of other people's hands.
What does it even mean? (Let's say we have 5 parties of 2, 4, 6, 8, 10 people separately. And all people from each party shake hands with each other within each party. Then I believe 2 people party has 1 handshake( which is odd number), but for the rest, the party of 4 should have 6 handshakes, and the party of 6 should have 15 handshakes, and the party of 8 should have 28 handshakes.
Q2: Can someone please help me understand the colloquial terms statement better with some concrete examples ?