Journal of Combinatorics
Volume 10 (2019)
Fractional triangle decompositions of dense $3$-partite graphs
Pages: 255 – 282
We compute a minimum degree threshold sufficient for $3$-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, Kühn, 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.
The second author’s research is supported by NSERC grant 312595–2010.
Received 30 October 2015
Published 25 January 2019