Clique decompositions of multipartite graphs and completion of Latin squares


Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one. Together with very recent results of Bowditch and Dukes as well as Montgomery on fractional decompositions into triangles… (More)
DOI: 10.1016/j.jcta.2017.04.005

3 Figures and Tables


  • Presentations referencing similar topics