A robust version of the multipartite Hajnal--Szemerédi theorem
arXiv:2311.00950
Abstract
In this note we show the following strengthening of a multipartite version of the Hajnal--Szemerédi theorem. For an integer and , there exists a constant such that if and is a balanced -partite graph with each vertex class of size and , then with high probability the random subgraph of contains a -factor. We also use it to derive corresponding transversal versions.
13 pages