Showing math.COShow all
3 papers · 1 filter
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 , the inversion of a subset of vertices consists in reversing the orientation of all arcs with both endpoints in . When the subset is of size…
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 complicated…
math.CO2020
Connectivity of orientations of 3-edge-connected graphs
Florian Hörsch, Zoltán Szigeti
We attempt to generalize a theorem of Nash-Williams stating that a graph has a -arc-connected orientation if and only if it is -edge-connected. In a strongly connected digra…