Packing 5-cycles into balanced complete \(n\)-partite graphs for even \(n\): the 1-factor leave (Q4995290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7362654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing 5-cycles into balanced complete \(n\)-partite graphs for even \(n\): the 1-factor leave |
scientific article; zbMATH DE number 7362654 |
Statements
23 June 2021
0 references
maximum packing
0 references
balanced complete \(n\)-partite graph
0 references
0.9220169186592102
0 references
0.8241916298866272
0 references
0.8044406175613403
0 references
