Fractional Clique Decompositions of Dense Partite Graphs
Abstract
We give a minimum degree condition sufficent to ensure the existence of a fractional Kr-decomposition in a balanced r-partite graph (subject to some further simple necessary conditions). This generalises the non-partite problem studied recently by Barber, Lo, K\"uhn, Osthus and the author, and the 3-partite fractional K3-decomposition problem studied recently by Dukes. Combining our result with recent work by Barber, K\"uhn, Lo, Osthus and Taylor, this gives a minimum degree condition sufficient to ensure the existence of a (non-fractional) Kr-decomposition in a balanced r-partite graph (subject to the same simple necessary conditions).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.