The partite folklore clique decomposition conjecture
Statement
Let be a balanced -partition of a -partite graph , with for every . Define
Call partite--divisible when, for every and every , one has .
Partite folklore conjecture. For each integer , the following holds for sufficiently large : if is a balanced partite--divisible -partite graph on vertices with
then admits a -decomposition.
This is the partite counterpart of the folklore high-minimum-degree conjecture for -decompositions and is connected to the existence of mutually orthogonal Latin squares. The source presents it as open.
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.