Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fractional Clique Decompositions of Dense Partite Graphs (1603.01039v1)

Published 3 Mar 2016 in math.CO

Abstract: We give a minimum degree condition sufficent to ensure the existence of a fractional $K_r$-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 $K_3$-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) $K_r$-decomposition in a balanced $r$-partite graph (subject to the same simple necessary conditions).

Summary

We haven't generated a summary for this paper yet.