Distributive lattices, polyhedra, and generalized flows

DOI10.1016/j.ejc.2010.07.011zbMath1205.06007arXiv0811.1541MaRDI QIDQ607363

Kolja Knauer, Stefan Felsner

Publication date: 22 November 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.1541

zbMATH Keywords

directed graph; distributive lattice; generalized flows; dominance order; \(D\)-polyhedron; bounding hyperplanes; vertex potentials

Mathematics Subject Classification ID

06D05: Structure and representation theory of distributive lattices

05C21: Flows in graphs

Related Items

Flip distances between graph orientations, Resonance graphs on perfect matchings of graphs on surfaces, Bounds on the coefficients of tension and flow polynomials, On lattice path matroid polytopes: integer points and Ehrhart polynomial, Bimonotone subdivisions of point configurations in the plane, Tropical Ehrhart theory and tropical volume

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cocircuit covers of bicircular matroids
• The duality conjecture in formal knot theory
• Two poset polytopes
• A distributive lattice on the set of perfect matchings of a plane bipartite graph
• On the number of bases of bicircular matroids
• Lattice structures from planar graphs
• The lattice structure of the set of domino tilings of a polygon
• Alcoved polytopes. I.
• On subgraphs as matroid cells
• Rings of sets
• The Lattice Structure of Flow in Planar Graphs
• Conway's Tiling Groups
• ULD-Lattices and Δ-Bonds
• Tropical and ordinary convexity combined
• On Max Flows with Gains and Pure Min-Cost Flows
• BICIRCULAR MATROIDS
• Lectures on Polytopes
• On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
• Fast and simple approximation schemes for generalized flow.