Connectivity functions and polymatroids

From MaRDI portal




Abstract: A {em connectivity function on} a set E is a function lambda:2EightarrowmathbbR such that lambda(emptyset)=0, that lambda(X)=lambda(EX) for all XsubseteqE and that lambda(XcapY)+lambda(XcupY)leqlambda(X)+lambda(Y) for all X,YsubseteqE. 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.









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)