Showing math.COShow all
3 papers · 1 filter
math.CO2026
Locally anti-blocking -polytopes for flow polytopes
Jonah Berggren, Benjamin Braun, Alvaro Cornejo +6
Given an acyclic directed graph (DAG), the space of strength one flows is a lattice polytope called the flow polytope of the DAG. If the DAG admits an ample framing, then the flow…
math.CO2025
Flow polytopes for extensions of bipartite graphs
Benjamin Braun, Kaitlin Bruegge, Robert Davis +1
The space of unit flows on a finite acyclic directed graph is a lattice polytope called the flow polytope of the graph. Given a bipartite graph with minimum degree at least two…
math.CO2024
Volume inequalities for flow polytopes of full directed acyclic graphs
Benjamin Braun, James Ford McElroy
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes f…