Blood volume

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$.

See also

• Hall's marriage theorem
• Bipartite matching

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.