A condition for matchability in hypergraphs (Q1900519): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Penny E. Haxell / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Vladimir D. Tonchev / rank | |||
Normal rank | |||
Revision as of 16:42, 10 February 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
