The following pages link to Stefan Ehard (Q1741517):
Displayed 17 items.
- Dynamic monopolies for interval graphs with bounded thresholds (Q1741518) (← links)
- Paths and cycles in random subgraphs of graphs with large minimum degree (Q1753122) (← links)
- On some tractable and hard instances for partial incentives and target set selection (Q2010927) (← links)
- Rainbow triangles and cliques in edge-colored graphs (Q2011150) (← links)
- Approximating connected safe sets in weighted trees (Q2184684) (← links)
- Low weight perfect matchings (Q2223441) (← links)
- Partial immunization of trees (Q2299985) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- Vaccinate your trees! (Q2632015) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree (Q6045404) (← links)
- On the extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q6300018) (← links)
- A short proof of the blow-up lemma for approximate decompositions (Q6332641) (← links)
- Biholes in balanced bipartite graphs (Q6338258) (← links)