Stefan Ehard

Available identifiers

Publication	Date of Publication	Type
A rainbow blow-up lemma for almost optimally bounded edge-colourings	2024-10-18	Paper
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree	2023-05-30	Paper
A Short proof of the blow-up lemma for approximate decompositions	2023-01-23	Paper
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree	2022-10-12	Paper
Pseudorandom hypergraph matchings	2021-06-15	Paper
Low weight perfect matchings	2021-01-29	Paper
A rainbow blow-up lemma for almost optimally bounded edge-colourings	2020-11-20	Paper
Approximating connected safe sets in weighted trees	2020-05-29	Paper
Biholes in balanced bipartite graphs	2020-04-07	Paper
Partial immunization of trees	2020-02-24	Paper
A short proof of the blow-up lemma for approximate decompositions	2020-01-10	Paper
On some tractable and hard instances for partial incentives and target set selection	2019-11-28	Paper
Rainbow triangles and cliques in edge-colored graphs	2019-11-28	Paper
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives	2019-06-18	Paper
Vaccinate your trees!	2019-05-17	Paper
Dynamic monopolies for interval graphs with bounded thresholds	2019-05-03	Paper
Paths and cycles in random subgraphs of graphs with large minimum degree	2018-05-25	Paper
On the extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives	2018-04-06	Paper

This page was built for person: Stefan Ehard