| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8941805 | Discrete Applied Mathematics | 2018 | 5 Pages |
Abstract
Independently, Pokrovskiy and Sudakov recently proved that every properly edge-coloured Kn contains Ω(n) isomorphic pairwise edge-disjoint rainbow spanning trees.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
József Balogh, Hong Liu, Richard Montgomery,