Showing math.COShow all
2 papers · 1 filter
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.CO2023
Directed hypergraph connectivity augmentation by hyperarc reorientations
Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
The orientation theorem of Nash-Williams states that an undirected graph admits a -arc-connected orientation if and only if it is -edge-connected. Recently, Ito et al. showe…