Multipartite tiling threshold conjecture
Statement
Let be a graph with order and chromatic number . Let denote its critical chromatic number and let denote its highest common factor. For a balanced -partite graph , let be its pairwise minimum degree. Multipartite tiling threshold conjecture. There exist integers and such that, for all , if is a balanced -partite graph with vertices in each partition set and
then contains an -factor. This is proposed as an analogue of the bipartite tiling threshold and the supplied text gives no resolution.
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.