2 papers
math.CO2026
Hitting cycles through prescribed vertices or edges
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
We prove that for every set of vertices of a directed graph , the maximum number of vertices in contained in a collection of vertex-disjoint cycles in is at least th…
math.CO2025
A generalisation of Menger's theorem in bidirected graphs
Ebrahim Ghorbani, Jana Katharina Nickel, Florian Reich
Menger's theorem - the maximum number of vertex-disjoint - paths is equal to the minimum size of an - separator - is generally not true in bidirected graphs. We prove t…