Gupta, PranshuPranshuGuptaHamann, FabianFabianHamannMüyesser, AlpAlpMüyesserParczyk, OlafOlafParczykSgueglia, AmedeoAmedeoSgueglia2023-08-182023-08-182023-12Bulletin of the London Mathematical Society 55 (6): 2817-2839 (2023-12)https://hdl.handle.net/11420/42782Given a collection of hypergraphs (Formula presented.) with the same vertex set, an (Formula presented.) -edge graph (Formula presented.) is a transversal if there is a bijection (Formula presented.) such that (Formula presented.) for each (Formula presented.). How large does the minimum degree of each (Formula presented.) need to be so that (Formula presented.) necessarily contains a copy of (Formula presented.) that is a transversal? Each (Formula presented.) in the collection could be the same hypergraph, hence the minimum degree of each (Formula presented.) needs to be large enough to ensure that (Formula presented.). Since its general introduction by Joos and Kim (Bull. Lond. Math. Soc. 52 (2020) 498–504), a growing body of work has shown that in many cases this lower bound is tight. In this paper, we give a unified approach to this problem by providing a widely applicable sufficient condition for this lower bound to be asymptotically tight. This is general enough to recover many previous results in the area and obtain novel transversal variants of several classical Dirac-type results for (powers of) Hamilton cycles. For example, we derive that any collection of (Formula presented.) graphs on an (Formula presented.) -vertex set, each with minimum degree at least (Formula presented.), contains a transversal copy of the (Formula presented.) th power of a Hamilton cycle. This can be viewed as a rainbow version of the Pósa–Seymour conjecture.en1469-21202023628172839John Wiley and Sons Ltdhttps://creativecommons.org/licenses/by/4.0/MathematicsJournal Article10.15480/882.825810.1112/blms.1289610.15480/882.8258Journal Article