perfect matching

views updated

perfect matching A term used in graph theory. A matching of a graph is any subset of its edges such that no two members of the subset are adjacent. A perfect matching is a matching in which every vertex of the graph is an end-point of some element of the matching.