PERFECT MATCHING

Domain	Definition
Math	A matching, or subset of edges without common vertices, of a connected graph that touch all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex. (references)
Source: compiled by the editor from various references; see credits.

Specialty Definition: Perfect matching

A perfect matching for a connected graph is a matching, or subset of edges without common vertices, which touch all vertices exactly once. A graph with an odd number of vertices is allowed one unmatched vertex.

Note: Since an undirected, connected graph without self-loops has n(n-1)/2 edges, where n is the number of vertices, a perfect match consists of n/2 of the edges. The name of the term comes from matching each vertex with exactly one other vertex.

Anagrams: PERFECT MATCHING

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-c-c-e-e-f-g-h-i-m-n-p-r-t-t"
	-4 letters: attempering, metacentric, metanephric, parenthetic, reaccepting.
	-5 letters: cathecting, chamfering, chaptering, chattering, empathetic, feathering, hemipteran, impregnate, perfecting, permeating, pinfeather, preachment, preheating, ratcheting, rematching, remittance, repatching, reteaching.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.