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ü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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.