Connectivity functions and polymatroids
From MaRDI portal
Abstract: A {em connectivity function on} a set is a function such that , that for all and that for all . Graphs, matroids and, more generally, polymatroids have associated connectivity functions. We introduce a notion of duality for polymatroids and prove that every connectivity function is the connectivity function of a self-dual polymatroid. We also prove that every integral connectivity function is the connectivity function of a half-integral self-dual polymatroid.
Recommendations
Cites work
- Computing with Tangles
- Duality in Polymatroids and Set Functions
- Graph minors. X: Obstructions to tree-decomposition
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Matroids having the same connectivity function
- On the connectivity function of a matroid
- Tangles, tree-decompositions and grids in matroids
- Tangles, trees, and flowers
- The branchwidth of graphs and their cycle matroids
Cited in
(7)- A characterization of extendable connectivity functions
- Connectivity of submodular functions
- Recognising graphic and matroidal connectivity functions
- Submodular functions and rooted trees
- A splitter theorem for 3-connected 2-polymatroids
- Duality in Polymatroids and Set Functions
- A new polynomial for polymatroids
This page was built for publication: Connectivity functions and polymatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730631)