Monotonicity of polymatroids

DOI10.1007/BF02863013MaRDI QIDQ796543zbMATH OpenOpenAlexFDO

Authors Arun K. Pujari, Pramod Kumar Das

Publication date 1983

Published in Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02863013

zbMATH Keywords

monotonicitypolymatroidrank function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

For polymatroids, there is no number t such that the t-monotonicity implies the k-monotonicity for any \(k>t\). The monotonicity of polymatroids is a number m such that the polymatroid is k-monotone if and only if \(k<m\). The authors compute the value of m expressed as a function of the rank function of the polymatroid.

Recommendations

• An inequality for polymatroid functions and its applications.
• scientific article; zbMATH DE number 3906513
• Monotone clutters
• THE CRITICAL PROBLEM FOR POLYMATROIDS
• Paths on polymatroids

Cites work

• A characterization of threshold matroids

Cited in

(5)

• On the monotonization of polyhedra
• A graph theoretic approach to strong monotonicity with respect to polyhedral cones
• The monoid of monotone functions on a poset and quasi-arithmetic multiplicities for uniform matroids
• Monotonicity properties for ranks of overpartitions
• scientific article; zbMATH DE number 5000474 (Why is no real title available?)

This page was built for publication: Monotonicity of polymatroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796543)