Given a collection G = (G1, . . . , G h ) of graphs on the same vertex set V of size n, an h-edge graph H on the vertex set V is a G-transversal if there exists a bijection λ :for each e ∈ E(H). The conditions on the minimum degree δ(G) = min i∈[h] {δ(Gi)} for finding a spanning G-transversal isomorphic to a graph H have been actively studied when H is a Hamilton cycle, an F -factor, a spanning tree with maximum degree o(n/ log n) and a power of a Hamilton cycle, etc. In this paper, we determined the asymptotically tight threshold on δ(G) for finding a G-transversal isomorphic to H when H is a general n-vertex graph with bounded maximum degree and o(n)-bandwidth. This provides a transversal generalization of the celebrated Bandwidth theorem by Böttcher, Schacht and Taraz.