Florian Hörsch

collaborators

4 papers

math.CO2025

Making an oriented graph acyclic using inversions of bounded or prescribed size

JÃ¸rgen Bang-Jensen, FrÃ©dÃ©ric Havet, Florian HÃ¶rsch +3

Given an oriented graph $D$ , the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endpoints in $X$ . When the subset $X$ is of size…

cs.CC2025

Maximum Reachability Orientation of Mixed Graphs

Florian HÃ¶rsch

We aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph $D$ , we use $P (D)$ for…

math.CO2024

Diameter of the inversion graph

In an oriented graph $G$ , the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endvertices in $X$ . The inversion graph of a l…

math.CO2024

Matroid-reachability-based decomposition into arborescences

Florian HÃ¶rsch, Benjamin Peyrille, ZoltÃ¡n Szigeti

The problem of matroid-reachability-based packing of arborescences was solved by KirÃ¡ly. Here we solve the corresponding decomposition problem that turns out to be more complicate…