On the complexity of packing rainbow spanning trees – new research article by Gergely Csáji
![](https://krtk.hun-ren.hu/wp-content/uploads/2023/01/discretemathematics.jpg)
On the complexity of packing rainbow spanning trees Kristóf Bérczi, Gergely Csáji, Tamás Király Discrete Mathematics, Volume 346, Issue 4, April 2023 Abstract One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list […]