2 citations · 5 across the 10 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
math.CO2023
Packing mixed hyperarborescences
Zoltán Szigeti
The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao, Yang \cite{GY} on matroid-reachability-based…
math.CO2023
On reversing arcs to improve arc-connectivity
Pierre Hoppenot, Zoltán Szigeti
We show that if the arc-connectivity of a directed graph is at most and the reorientation of an arc set in results in a -arc-connected…
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…