TL;DR
This paper applies recent decomposition techniques to hypergraphs with coloured or directed edges, providing new conditions for decomposing such structures into specific subgraphs like rainbow triangles and tight q-cycles.
Contribution
It introduces general conditions for decomposing coloured and directed hypergraphs into particular substructures, expanding the scope of decomposition methods.
Findings
Conditions for decomposing edge-coloured graphs into rainbow triangles
Methods for decomposing r-digraphs into tight q-cycles
Applications of recent decomposition results to coloured and directed complexes
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory