Coloured and directed designs

Author: 

Keevash, P

Publication Date: 

4 February 2020

Journal: 

Building Bridges II: Mathematics of László Lovász

Last Updated: 

2021-06-12T14:34:36.977+01:00

DOI: 

10.1007/978-3-662-59204-5_9

page: 

279-315

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.

Symplectic id: 

891597

Submitted to ORA: 

Submitted

Publication Type: 

Journal Article

ISBN-13: 

978-3-662-59203-8