1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Stefan Ehard, Stefan Glock, Felix Joos
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy and Szemerédi tha…
Pseudorandom hypergraph matchings
Stefan Ehard, Stefan Glock, Felix Joos
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect ma…
Decompositions into isomorphic rainbow spanning trees
Stefan Glock, Daniela Kühn, Richard Montgomery +1
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring of a sufficiently large com…