Talk:Handshaking lemma

{{GA|21:05, 13 November 2021 (UTC)|topic=Mathematics and mathematicians|page=1|oldid=1055097995}}

{{Talk header}}

{{DYK talk|25 November|2021|entry=... that whenever some of the people in a party shake hands, the number of people who shake an odd number of other people's hands is even?|nompage=Template:Did you know nominations/Handshaking lemma}}

{{WikiProject banner shell|class=GA|vital=yes|1=

{{WikiProject Mathematics|importance=mid}}

}}

I read: "every finite undirected graph has an even number of vertices with odd degree"

Why is the graph supposed undirected?

It seems to me this this lemma is also valid for directed graphs...

:For directed graphs there may exist odd numbers of vertices with odd indegree or odd outdegree (consider the graph with one directed edge). It's true for total degree but that's essentially the same as the degree in the underlying undirected graph. —David Eppstein (talk) 15:52, 28 September 2013 (UTC)

{{Talk:Handshaking lemma/GA1}}