| الوصف: |
Consider a multipartite graph $G$ with maximum degree at most $n-o(n)$, parts $V_1,\ldots,V_k$ have size $|V_i|=n$, and every vertex has at most $o(n)$ neighbors in any part $V_i$. Loh and Sudakov proved that any such $G$ has an independent transversal. They further conjectured that the vertex set of $G$ can be decomposed into pairwise disjoint independent transversals. In the present paper, we resolve this conjecture approximately by showing that $G$ contains $n-o(n)$ pairwise disjoint independent transversals. As applications, we give approximate answers to questions of Yuster, and of Fischer, K\"uhn, and Osthus. |
