Multipartite Hajnal–Szemerédi perfect packing conjecture
Statement
Let and let be a -partite graph with parts of the same size . Define the partite minimum degree of to be the largest integer such that every vertex has at least neighbors in each part other than its own. A perfect -packing is a collection of vertex-disjoint -cliques covering all vertices of . Fischer–Kühn–Osthus's conjecture. If the partite minimum degree of is at least , then has a perfect -packing unless both and are odd and is isomorphic to a single exceptional graph. The statement is presented as an application conjecture in the source; its resolution status is not given.
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.