Rainbow factors in hypergraphs

Matthew Coulson; Peter Keevash; Guillem Perarnau; Liana Yepremyan

Rainbow factors in hypergraphs

Combinatorics 2018-03-29 v1

Authors: Matthew Coulson , Peter Keevash , Guillem Perarnau , Liana Yepremyan

Abstract

For any $r$ -graph $H$ , we consider the problem of finding a rainbow $H$ -factor in an $r$ -graph $G$ with large minimum $\ell$ -degree and an edge-colouring that is suitably bounded. We show that the asymptotic degree threshold is the same as that for finding an $H$ -factor.

Keywords

rainbow coloring rainbow connection graph coloring

Cite

@article{arxiv.1803.10674,
  title  = {Rainbow factors in hypergraphs},
  author = {Matthew Coulson and Peter Keevash and Guillem Perarnau and Liana Yepremyan},
  journal= {arXiv preprint arXiv:1803.10674},
  year   = {2018}
}

Comments

10 pages

Related papers

View all related →