WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Handshaking lemma
Uncommon card · Science
Handshaking lemma, an Uncommon card
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.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 69
- DEF
- 67
- Power
- 136
- Wikipedia reads a year
- 23,000
Power 136 (ATK + DEF): stronger than 70 % of WikiCards cards.
Handshaking lemma quiz: 3 questions
Three questions on the Handshaking lemma card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
Both results were proven by Leonhard Euler in his famous paper on the Seven Bridges of ______ that began the study of graph theory.
Answer
Königsberg. Both results were proven by Leonhard Euler in his famous paper on the Seven Bridges of Königsberg that began the study of graph theory. From the Handshaking lemma article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
1991 NASCAR Winston Cup Series. 1991 NASCAR Winston Cup Series 87 · Joshua Angrist 75 · Danny Hillis 72 · Handshaking lemma 69 ATK in WikiCards.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- 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.
- The handshaking lemma is a consequence of the degree sum formula, also sometimes called the handshaking lemma, according to which the sum of the degrees equals twice the number of edges in the graph.
- Both results were proven by Leonhard Euler in his famous paper on the Seven Bridges of Königsberg that began the study of graph theory.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Handshaking lemma article was read about 23,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 69 and blocks with 67: each hit it takes is cut by 27 %.
How to get Handshaking lemma
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Science cards
Cards close in power
The cards just above and just below Handshaking lemma in the power ranking, all domains together.
- Adam EatonUncommon · Society · ATK 67 DEF 69
- Chaharmahal and Bakhtiari provinceUncommon · Society · ATK 70 DEF 66
- Charles WarrenUncommon · History · ATK 71 DEF 65
- Marian McPartlandUncommon · Arts · ATK 73 DEF 63
- William NordhausUncommon · History · ATK 72 DEF 64
- 1991 NASCAR Winston Cup SeriesUncommon · Society · ATK 87 DEF 49
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Handshaking lemma (revision), CC BY-SA 4.0. Photo : AzaToth, Public domain, Wikimedia Commons.
