saturate

Let $G(V,E)$ be a graph and $M$ a matching in $G$. A vertex $v\in V(G)$ is said to be saturated by $M$ if there is an edge in $M$ incident to $v$. A vertex $v\in V(G)$ with no such edge is said to be unsaturated by $M$. We also say that $M$ saturates $v$.

Title	saturate
Canonical name	Saturate
Date of creation	2013-03-22 13:57:57
Last modified on	2013-03-22 13:57:57
Owner	mathcam (2727)
Last modified by	mathcam (2727)
Numerical id	4
Author	mathcam (2727)
Entry type	Definition
Classification	msc 05D15
Synonym	saturates
Synonym	saturated
Related topic	HallsMarriageTheorem
Related topic	BipartiteMatching
Related topic	Matching