3 papers
cs.DS2026
Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs
David Alemán Espinosa, Niklas Schlomberg
The multicommodity flow problem in an undirected capacitated graph is specified by a set of source-sink pairs with nonnegative demands. A flow is feasible if it routes all dema…
math.CO2026
Curves on the torus with few intersections
Igor Balla, Marek Filakovský, BartÅomiej Kielak +2
Aougab and Gaster [Math. Proc. Cambridge Philos. Soc. 174 (2023), 569-584] proved that any set of simple closed curves on the torus, where any two are non-homotopic and intersect a…
math.CO2025
Improved ErdÅs-Pósa inequalities for odd cycles in planar graphs
Luise Puhlmann, Niklas Schlomberg
In an undirected graph, the odd cycle packing number is the maximum number of pairwise vertex-disjoint odd cycles. The odd cycle transversal number is the minimum number of vertice…