Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call