S. Dreyer

collaborators

3 papers

cs.DM2026

Zero Forcing Sets in Temporal Graphs

Julien Baste, Simon Dreyer, Clara Marcille +2

The Zero Forcing (or corruption) of a graph is the problem of finding a minimum-size ``corrupting'' set. It corresponds to a subset of its vertices that can corrupt the whole graph…

math.CO2026

Feedback vertex sets in oriented graphs

Simon Dreyer

For an oriented graph $G$ , denote by $f v s (G)$ the minimum number of vertices whose deletion from $G$ makes it acyclic. We show that an oriented graph $G$ on $n$ vertices and $m$ ar…

math.CO2026

Feedback vertex sets of planar digraphs with fixed digirth

Simon Dreyer, Alexandre Pinlou, Petru Valicov

Let $f v s (G)$ denote the size of a minimum feedback vertex set of a digraph $G$ . We study $f v s_{g} (n)$ , which is the maximum $f v s (G)$ over all $n$ -vertex planar digraphs $G$ of digirt…