Connectivity functions and polymatroids

From MaRDI portal
Publication:730631

DOI10.1016/J.AAM.2016.06.004zbMATH Open1352.05045arXiv1605.01455OpenAlexW2963451339MaRDI QIDQ730631FDOQ730631


Authors: Susan Jowett, Songbao Mo, Geoff Whittle Edit this on Wikidata


Publication date: 28 December 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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.


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




Recommendations



Cites Work


Cited In (6)





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)