3 papers
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.CO2018
Vaccinate your trees!
Stefan Ehard, Dieter Rautenbach
For a graph and an integer-valued function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of that hav…
math.CO2017
Approximating Connected Safe Sets in Weighted Trees
Stefan Ehard, Dieter Rautenbach
For a graph and a non-negative integral weight function on the vertex set of , a set of vertices of is -safe if for every component of the…