Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539)
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: Perfect f-matchings and f-factors in hypergraphs -- a combinatorial approach |
scientific article; zbMATH DE number 6755348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach |
scientific article; zbMATH DE number 6755348 |
Statements
Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (English)
0 references
1 August 2017
0 references
perfect \(f\)-matchings in hypergraphs
0 references
\(f\)-factors in hypergraphs
0 references
Mengerian hypergraph
0 references
balanced hypergraph
0 references
perfect hypergraph
0 references
Hall's theorem
0 references
0.8224104046821594
0 references
0.8209696412086487
0 references
0.8089942932128906
0 references
0.8047723770141602
0 references
0.7979344129562378
0 references
