Hall's marriage theorem
theorem that a finite bipartite graph has a perfect matching iff any subset of vertices from one group has a neighbourhood of equal or greater size
Press Enter · cited answer in seconds
0 sources
Hall's marriage theorem
Summary
Hall's marriage theorem is a theorem[1]. It draws 163 Wikipedia views per month (theorem category, ranking #153 of 1,306).[2]
Key Facts
- Hall's marriage theorem's image is recorded as Halls theorem matching graph theory2.svg[3].
- Hall's marriage theorem's instance of is recorded as theorem[4].
- Philip Hall is named after Hall's marriage theorem[5].
- Hall's marriage theorem's part of is recorded as list of theorems[6].
- Hall's marriage theorem's Freebase ID is recorded as /m/019kt3[7].
- Hall's marriage theorem's Encyclopædia Britannica Online ID is recorded as topic/Halls-theorem[8].
- Hall's marriage theorem's different from is recorded as Ménage problem[9].
- Hall's marriage theorem's studied by is recorded as graph theory[10].
- Hall's marriage theorem's MathWorld ID is recorded as HallsTheorem[11].
- Hall's marriage theorem's maintained by WikiProject is recorded as WikiProject Mathematics[12].
- Hall's marriage theorem's Microsoft Academic ID is recorded as 117652263[13].
- Hall's marriage theorem's Brilliant Wiki ID is recorded as hall-marriage-theorem[14].
- Hall's marriage theorem's ProofWiki ID is recorded as Hall's_Marriage_Theorem[15].
- Hall's marriage theorem's PlanetMath ID is recorded as HallsMarriageTheorem[16].
- Hall's marriage theorem's PlanetMath ID is recorded as HallsMarriageTheoremProofOf[17].
- Hall's marriage theorem's Metamath statement ID is recorded as marypha1[18].
Why It Matters
Hall's marriage theorem draws 163 Wikipedia views per month (theorem category, ranking #153 of 1,306).[2] It has Wikipedia articles in 17 language editions, a strong signal of global cultural recognition.[19] It is known by 7 alternative names across languages and contexts.[20]