Answers are grounded in this paper and cite their sources.
We prove a Dirac-type condition for an r-partite graph to admit a fractional clique decomposition: every sufficiently large r-partite graph with n vertices in each part and partite minimum degree at least (1 - 1/30r²) n admits a fractional Kᵣ-decomposition, subject to necessary divisibility conditions. This implies the same upper bound on the asymptotic minimum degree threshold for r-partite graphs to admit a Kᵣ-decomposition, using a well-known reduction.
No takes yet. Share an insight, caveat, or question.
Longbrake et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: