A condition for matchability in hypergraphs (Q1900519)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A condition for matchability in hypergraphs |
scientific article; zbMATH DE number 811344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A condition for matchability in hypergraphs |
scientific article; zbMATH DE number 811344 |
Statements
A condition for matchability in hypergraphs (English)
0 references
31 October 1995
0 references
A complete matching in a hypergraph is a partition of the vertex set into pairwise disjoint edges. An analog of Hall's theorem about complete matchings in certain hypergraphs is proved.
0 references
matching
0 references
hypergraph
0 references
Hall's theorem
0 references
0.842262864112854
0 references
0.8409501314163208
0 references
0.8284034132957458
0 references
0.8249437808990479
0 references
0.8245797157287598
0 references
