Almost all optimally coloured complete graphs contain a rainbow Hamilton path (Q2673480)
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 7539412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all optimally coloured complete graphs contain a rainbow Hamilton path |
scientific article; zbMATH DE number 7539412 |
Statements
Almost all optimally coloured complete graphs contain a rainbow Hamilton path (English)
0 references
10 June 2022
0 references
Andersen's conjecture
0 references
edge-colouring
0 references
rainbow path
0 references
rainbow cycle
0 references
hypergraph matchings
0 references
distributive absorption
0 references
Latin squares
0 references
0 references
0.8645738959312439
0 references
0.8484417200088501
0 references
0.8227273225784302
0 references
0.810355544090271
0 references
0.8002691268920898
0 references
