Rainbow spanning trees in complete graphs colored by one‐factorizations
Rainbow spanning trees in complete graphs colored by one‐factorizations
Abstract Brualdi and Hollingsworth conjectured that, for even n , in a proper edge coloring of using precisely colors, the edge set can be partitioned into spanning trees which are rainbow (and hence, precisely one edge from each color class is in each spanning tree). They proved that there always …