84 citations · 137 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
Facets of Random Symmetric Edge Polytopes, Degree Sequences, and Clustering
Benjamin Braun, Kaitlin Bruegge, Matthew Kahle
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symm…
Triangulations of Flow Polytopes, Ample Framings, and Gentle Algebras
Matias von Bell, Benjamin Braun, Kaitlin Bruegge +4
The cone of nonnegative flows for a directed acyclic graph (DAG) is known to admit regular unimodular triangulations induced by framings of the DAG. These triangulations restrict t…
Facets of Symmetric Edge Polytopes for Graphs with Few Edges
Benjamin Braun, Kaitlin Bruegge
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) givin…