An improved minimum degree threshold for fractional clique decompositions in partite graphs
arXiv:2611.08432
Abstract
We prove a Dirac-type condition for an -partite graph to admit a fractional clique decomposition: every sufficiently large -partite graph with vertices in each part and partite minimum degree at least admits a fractional -decomposition, subject to necessary divisibility conditions. This implies the same upper bound on the asymptotic minimum degree threshold for -partite graphs to admit a -decomposition, using a well-known reduction.
arXiv comment33 pages, 2 figures