Rainbow spanning structures in graph and hypergraph systems
Rainbow spanning structures in graph and hypergraph systems
Abstract We study the following rainbow version of subgraph containment problems in a family of (hyper)graphs, which generalizes the classical subgraph containment problems in a single host graph. For a collection $\mathit {\mathbf {G}}=\{G_1, G_2,\ldots , G_{m}\}$ of not necessarily distinct k -graphs on the same vertex set $[n]$ , …