Handshaking lemmaHandshaking lemma
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In graph theory, the handshaking lemma is the statement that, in every finite undirected graph, the number of vertices that touch an odd number of edges is even. For example, if there is a party of people who shake hands, the number of people who shake an odd number of other people's hands is even.
Excerpt from the Wikipedia article “Handshaking lemma”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: AzaToth, Public domain, via Wikimedia Commons.
Open free boosters and add Handshaking lemma to your collection.
Play for free




