Approximate multipartite version of the Hajnal–Szemerédi theorem

Let q be a positive integer, and G be a q-partite simple graph on qn vertices, with n vertices in each vertex class. Let , where . If each vertex of G is adjacent to at least δn vertices in each of the other vertex classes, q is bounded and n is large enough, then G has a Kq-factor.