Perfect matching
id:
perfect-matching-225-1649267
title:
Perfect matching
text:
In graph theory, a perfect matching in a graph is a matching that covers every vertex of the graph. More formally, given a graph G =, a perfect matching in G is a subset M of edge set E, such that every vertex in the vertex set V is adjacent to exactly one edge in M. A perfect matching is also called a 1-factor; see Graph factorization for an explanation of this term. In some literature, the term complete matching is used. Every perfect matching is a maximum-cardinality matching, but the opposit
brand slug:
wiki
category slug:
encyclopedia
description:
Matching which covers every node of the graph
original url:
https://en.wikipedia.org/wiki/Perfect_matching
date created:
2002-03-12T10:06:18Z
date modified:
2024-09-14T20:11:56Z
main entity:
{"identifier":"Q99567093","url":"https://www.wikidata.org/entity/Q99567093"}
image:
fields total:
13
integrity:
15