A condition for matchability in hypergraphs (Q1900519): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Matchings in n-partite n-graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a criterion for matchability in hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a possible extension of Hall's theorem to bipartite hypergraphs / rank | |||
Normal rank | |||
Latest revision as of 16:59, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A condition for matchability in hypergraphs |
scientific article |
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
