Perfect matching and Hamilton tight cycle decomposition of complete \(n\)-balanced \(r\)-partite \(k\)-uniform hypergraphs (Q5028355)
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 and Hamilton tight cycle decomposition of complete n-balanced r-partite k-uniform hypergraphs |
scientific article; zbMATH DE number 7471548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect matching and Hamilton tight cycle decomposition of complete \(n\)-balanced \(r\)-partite \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 7471548 |
Statements
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs (English)
0 references
9 February 2022
0 references
\(r\)-partite
0 references
\(k\)-uniform hypergraph
0 references
perfect matching decomposition
0 references
Hamilton tight cycle decomposition
0 references
0.9618502259254456
0 references
0.9505874514579772
0 references
0.8441908955574036
0 references
0.8427569270133972
0 references
0.8285050988197327
0 references
