Rainbow factors in hypergraphs

@article{Coulson2020RainbowFI,
  title={Rainbow factors in hypergraphs},
  author={M. Coulson and Peter Keevash and G. Perarnau and Liana Yepremyan},
  journal={J. Comb. Theory, Ser. A},
  year={2020},
  volume={172},
  pages={105184}
}
  • M. Coulson, Peter Keevash, +1 author Liana Yepremyan
  • Published 2020
  • Mathematics, Computer Science
  • J. Comb. Theory, Ser. A
  • 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. 
    5 Citations
    Properly colored Hamilton cycles in Dirac-type hypergraphs
    • Highly Influenced
    • PDF
    Rainbow structures in locally bounded colourings of graphs.
    • 11
    • Highly Influenced
    • PDF
    A Rainbow Dirac's Theorem
    • 8
    • PDF
    Counting Hamilton cycles in Dirac hypergraphs
    • PDF
    A rainbow blow-up lemma.
    • 7
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Rainbow H-factors
    • R. Yuster
    • Computer Science, Mathematics
    • Electron. J. Comb.
    • 2006
    • 16
    • PDF
    Rainbow matchings in Dirac bipartite graphs
    • 8
    • PDF
    Rainbow Turán Problems
    • 44
    • PDF
    Robustness of graph properties
    • 20
    • PDF
    The minimum degree threshold for perfect graph packings
    • 114
    • PDF
    Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs
    • 14
    • PDF
    Proof of the Alon-Yuster conjecture
    • 128
    • PDF
    Large-scale structures in random graphs
    • 14
    • PDF
    Proof of the bandwidth conjecture of Bollobás and Komlós
    • 80
    • PDF