WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Graph homomorphism
Common card · Science
Graph homomorphism, a Common card
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure.
- Rarity
- Common
- Domain
- Science
- ATK
- 73
- DEF
- 76
- Power
- 149
- Wikipedia reads a year
- 9,800
Ranked #1,974 of the 3,000 cards of the base set by power (ATK + DEF).
Graph homomorphism quiz: 3 questions
Three questions on the Graph homomorphism card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
More concretely, it is a ______ between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.
Answer
function. More concretely, it is a function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices. From the Graph homomorphism article on Wikipedia.
Which of these Wikipedia articles is read the most in a year?
Answer
24-cell. 24-cell 36,000 · Antlia 20,000 · Ground-level power supply 16,000 · Graph homomorphism 9,800 Wikipedia reads over a year.
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.
- More concretely, it is a function between the vertex sets of two graphs that maps adjacent vertices to adjacent vertices.
- Homomorphisms generalize various notions of graph colorings and allow the expression of an important class of constraint satisfaction problems, such as certain scheduling or frequency assignment problems.
- The fact that homomorphisms can be composed leads to rich algebraic structures: a preorder on graphs, a distributive lattice, and a category.
Why it is Common
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Graph homomorphism article was read about 9,800 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 73 and blocks with 76: each hit it takes is cut by 30 %.
How to get Graph homomorphism
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 Graph homomorphism in the power ranking, all domains together.
- ScenedesmusCommon · Nature · ATK 68 DEF 81
- California State Route 120Common · Society · ATK 71 DEF 78
- Chris O'GradyCommon · Society · ATK 72 DEF 77
- Japanese migration to IndonesiaCommon · Society · ATK 71 DEF 78
- Arctic methane emissionsCommon · Nature · ATK 68 DEF 81
- Willy VandersteenCommon · Arts · ATK 75 DEF 74
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, Graph homomorphism (revision), CC BY-SA 4.0. Photo : Tokenzero, CC0, Wikimedia Commons.
