Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
Hall's theorem
|
| gptkbp:appliesTo |
bipartite graphs
finite sets |
| gptkbp:field |
combinatorics
graph theory |
| gptkbp:generalizes |
gptkb:Rado's_theorem
matroid intersection theorem |
| https://www.w3.org/2000/01/rdf-schema#label |
Hall's marriage theorem
|
| gptkbp:namedAfter |
gptkb:Philip_Hall
|
| gptkbp:publicationYear |
1935
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_London_Mathematical_Society
|
| gptkbp:relatedTo |
gptkb:König's_theorem
bipartite matching perfect matching marriage problem |
| gptkbp:state |
A bipartite graph has a matching that covers every vertex of one part if and only if for every subset S of that part, the neighborhood of S has at least as many vertices as S.
|
| gptkbp:usedIn |
matroid theory
design theory matching theory network flow |
| gptkbp:bfsParent |
gptkb:König's_theorem
|
| gptkbp:bfsLayer |
6
|