Fractional triangle decompositions of dense 3-partite graphs

We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in particular the completion problem for sparse partial latin squares. Some extensions are considered as well.