1-Factor
Материал из WikiGrapp
1-Factor --- 1-фактор. For a given graph, 1-factor is 1-regular spanning subgraph. The 1-factor is often referred to as perfect matching. The existence of perfect matchings in bipartite graphs is a subject of the celebrated K\"{o}nig-Hall theorem.
See also
- [math]\displaystyle{ k }[/math]-Factor.
