3 papers
math.CO2026
Menger's theorem for ends of digraphs
Florian Reich
Polat generalised Menger's theorem -- the maximum number of vertex-disjoint paths between two sets and equals the minimum size of an - separator -- to ends of undirec…
math.CO2024
Halin's grid theorem for digraphs
Florian Reich
Halin showed that every thick end of every graph contains an infinite grid. We extend Halin's theorem to digraphs. More precisely, we show that for every infinite family $\mathcal{…
math.CO2024
Generating strongly 2-connected digraphs
Meike Hatzel, Stephan Kreutzer, Evangelos Protopapas +3
We prove that there exist four operations such that given any two strongly -connected digraphs and where is a butterfly-minor of , there exists a sequence $D_0,\d…