Rado's theorem for polymatroids

From MaRDI portal
Publication:4083682

DOI10.1017/S0305004100051677zbMath0321.05028OpenAlexW1968424093MaRDI QIDQ4083682

Colin J. H. McDiarmid

Publication date: 1975

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100051677



Related Items

k-Trails: Recognition, Complexity, and Approximations, A parameterized view to the robust recoverable base problem of matroids under structural uncertainty, Duality in Polymatroids and Set Functions, Polyhedral Clinching Auctions for Two-Sided Markets, Generalized polymatroids and submodular flows, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, A splitter theorem for 3-connected 2-polymatroids, Matroid matching and some applications, Unnamed Item, An inequality for polymatroid functions and its applications., Clinching auctions with online supply, Bounding the payment of approximate truthful mechanisms, A geometric theory of hypergraph colouring, Poset matching---a distributive analog of independent matching, Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions, On the subdifferential of a submodular function, Generating dual-bounded hypergraphs, Bi-submodular functions, distributive valuations, and distance functions in lattices, Polyhedral Clinching Auctions and the AdWords Polytope, A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids, \(k\)-trails: recognition, complexity, and approximations, Blocking, antiblocking, and pairs of matroids and polymatroids, Use of matroid theory in operations research, circuits and systems theory, Integral decomposition in polyhedra, Extended formulations of lower-truncated transversal polymatroids, Optimal matchings in posets



Cites Work