Independent transversals in bipartite correspondence-covers
Abstract
Suppose G and H are bipartite graphs and L: V(G) 2V(H) induces a partition of V(H) such that the subgraph of H induced between L(v) and L(v') is a matching whenever vv'∈ E(G). We show for each >0 that, if H has maximum degree D and |L(v)| (1+)D/ D for all v∈ V(G), then H admits an independent transversal with respect to L, provided D is sufficiently large. This bound on the part sizes is asymptotically sharp up to a factor 2. We also show some asymmetric variants of this result.
0