# Gallai's theorem

> identity in graph theory: α + τ = n

**Wikidata**: [Q1007698](https://www.wikidata.org/wiki/Q1007698)  
**Source**: https://4ort.xyz/entity/gallai-s-theorem


## References

1. [Source](https://math.stackexchange.com/questions/2187560/prove-that-the-sum-of-minimum-edge-cover-and-maximum-matching-is-the-vertex-coun)