Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735)
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 matching in k-partite k-graphs and 3-uniform HM-bipartite hypergraphs |
scientific article; zbMATH DE number 7342565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs |
scientific article; zbMATH DE number 7342565 |
Statements
Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (English)
0 references
3 May 2021
0 references
perfect matching
0 references
\(k\)-partite \(k\)-graph
0 references
HM-bipartite hypergraph
0 references
0.8880961537361145
0 references
0.8748103976249695
0 references
0.871430516242981
0 references
0.8706709146499634
0 references
0.8646348118782043
0 references
