An edge in a graph which has a perfect matching is an unmatchable edge if no perfect matching in the graph contains that edge.
Source: wiktionary
Ranked by relevance and common usage.
OpenGloss and ConceptNet supply richer edges like generalizations, collocations, and derivations.
1 translations across 1 languages.
3 total sentences available.
An edge in a graph which has a perfect matching is an unmatchable edge if no perfect matching in the graph contains that edge.
Source: wiktionary
Yes, the originals were fantastic, perhaps even unmatchable.
Source: wiktionary
Both the matchables and the unmatchables direct us along new lines of inquiry. The matchables invite study of kinship, neighbouring, and property as advantageous ladders of social advancement, while the unmatchables invite inquiry into risk, its incidence, and the strategies young people were employing […]
Source: wiktionary
Data sourced from Wiktionary, WordNet, CMU, and other open linguistic databases. Updated March 2026.