# Graph matching

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Graph matching](https://ocme.evemisslab.com/en/atlas/atlas-graph-matching/)

A matching in a finite graph is an edge subset whose edges share no endpoints; the empty matching is allowed.

atlas-graph-matching · canonical_mko

[Graph matching](https://ocme.evemisslab.com/en/mko/mko-graph-matching/)

## Prerequisite nodes


- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Subset](https://ocme.evemisslab.com/en/atlas/atlas-subset/)