The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs (Q6056724): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2023.113631 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2023.113631 / rank | |||
Normal rank | |||
Latest revision as of 18:02, 30 December 2024
scientific article; zbMATH DE number 7745185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 7745185 |
Statements
The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs (English)
0 references
4 October 2023
0 references
hypergraph
0 references
perfect matching
0 references
tight Hamilton cycle
0 references
complete \(k\)-partite graph
0 references
0 references
