OurBigBook About$ Donate
 Sign in Sign up

Perfect matching

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Computational mathematics Computational problems in graph theory Matching (graph theory)
 0 By others on same topic  0 Discussions Create my own version
In graph theory, a **perfect matching** (or complete matching) is a specific type of matching in a graph. A matching is defined as a set of edges without common vertices. In the case of a perfect matching, each vertex of the graph is included in exactly one edge of the matching.

 Ancestors (6)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook