Asymptotic multipartite Hajnal–Szemerédi conjecture
Statement
Fix an integer . Let be a balanced -partite graph on vertices, and let
be its minimum bipartite degree. Asymptotic multipartite Hajnal–Szemerédi conjecture. If
then either has a perfect -tiling, or both and are odd integers and is isomorphic to the fixed graph . This conjecture is the multipartite analogue of the Alon–Yuster theorem on perfect graph tilings; a slightly weaker version had appeared previously. The statement identifies the minimum bipartite degree threshold and the exceptional obstruction, but the supplied text does not indicate whether the conjecture has been resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.