ProbXiv
Explorersign in
Problem archiveProblem record

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.