Note on the spanning-tree packing number of lexicographic product graphs

The spanning-tree packing number of a graph GG is the maximum number of edge-disjoint spanning trees contained in GG. In this paper, we obtain a sharp lower bound for the spanning-tree packing number of lexicographic product graphs.