1-Factor

Материал из WEGA
Версия от 14:24, 27 апреля 2011; Glk (обсуждение | вклад) (Новая страница: «'''1-Factor''' --- 1-фактор. For a given graph, '''1-factor''' is 1-regular spanning subgraph. The '''1-factor''' is often referred to as ''perfect matching''…»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)

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.
Источник — http://pco.iis.nsk.su/wega/index.php?title=1-Factor&oldid=7232