For every maximum degree bound \Delta, does there exist n_0 such that for all n\geq n_0, whenever n-vertex graphs F_1,\ldots,F_t are r_i-regular with r_i\leq\Delta and…
Statement
For every maximum degree bound \Delta, does there exist n_0 such that for all n\geq n_0, whenever n-vertex graphs F_1,\ldots,F_t are r_i-regular with r_i\leq\Delta and \sum_{i=1}^t r_i=n-1, the complete graph K_n decomposes into F_1,\ldots,F_t?
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.