Multicolored forests in complete bipartite graphs (Q5948981): Difference between revisions

Given an edge coloring of a graph with \(k\) colors, the associated color distribution is an ordered \(k\)-tuple for which the \(i\)th coordinate gives the number of edges of color \(i\), \(i=1,2,\dots,k\). The authors develop inequalities and majorization conditions on color distributions of the \(n\)-regular complete bipartite graph which guarantee the existence of multicolored subgraphs, such as forests and spanning trees. They also give a conjecture regarding partitions of \(K_{n,n}\) into multicolored trees.