Edge-disjoint rainbow trees in properly coloured complete graphs (Q1690046)
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: Edge-disjoint rainbow trees in properly coloured complete graphs |
scientific article; zbMATH DE number 6827281
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-disjoint rainbow trees in properly coloured complete graphs |
scientific article; zbMATH DE number 6827281 |
Statements
Edge-disjoint rainbow trees in properly coloured complete graphs (English)
0 references
18 January 2018
0 references
edge-coloured complete graph
0 references
Brualdi-Hollingsworth conjecture
0 references
Constantine's conjecture
0 references
Kaneko-Kano-Suzuki conjecture
0 references
0.9638225
0 references
0.9439418
0 references
0.9372344
0 references
0.9368323
0 references
0.9334708
0 references
0.9311235
0 references
0.91964287
0 references
0.9190481
0 references
0.9179164
0 references
