Matching
One word, taught differently in 2 fields. Each use is given apart.
In Theory & Algos
A subgraph of a graph where every node has degree one, meaning every node is paired with at most one other node.
In Mathematics
A matching in a graph is a set of edges that do not share any common vertices.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
In Theory & Algos
1In Mathematics
1Lectures that assume it
3Connections
13The lectures that define it or assume it, and the concepts next to it.