1 citations · 2 across the 2 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
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…
math.CO2019
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…