1-Factor: различия между версиями
Перейти к навигации
Перейти к поиску
ALEXM (обсуждение | вклад) Нет описания правки |
KVN (обсуждение | вклад) Нет описания правки |
||
| Строка 2: | Строка 2: | ||
For a given graph, '''1-factor''' is 1-regular spanning subgraph. The '''1-factor''' is often referred to as ''perfect matching''. The existence of | 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 | perfect matchings in bipartite graphs is a subject of the celebrated | ||
K\"{o}nig-Hall theorem. | |||
==See also== | ==See also== | ||
*''<math>k</math>-Factor''. | *''<math>k</math>-Factor''. | ||
Текущая версия от 16:30, 23 октября 2018
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.