arXiv:1807.05770 [math.CO]AbstractReferencesReviewsResources
Coloured and directed designs
Published 2018-07-16Version 1
We give some illustrative applications of our recent result on decompositions of labelled complexes, including some new results on decompositions of hypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow triangles, and for decomposing an r-digraph into tight q-cycles.
Comments: 24 pages, 2 figures, for the 70th birthday of Laszlo Lovasz
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:2107.07450 [math.CO] (Published 2021-07-15)
Decompositions of even hypercubes into cycles whose length is a power of two
arXiv:2203.07768 [math.CO] (Published 2022-03-15)
Graphs without rainbow triangles
arXiv:1408.5296 [math.CO] (Published 2014-08-22)
Rainbow triangles in three-colored graphs