Fractional triangle decompositions of dense 3-partite graphs
Combinatorics
2016-09-13 v2
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.
Keywords
Cite
@article{arxiv.1510.08998,
title = {Fractional triangle decompositions of dense 3-partite graphs},
author = {Flora C. Bowditch and Peter J. Dukes},
journal= {arXiv preprint arXiv:1510.08998},
year = {2016}
}