Some excluded-minor theorems for a class of polymatroids

DOI10.1007/BF01303518zbMath0793.05041OpenAlexW2004779176MaRDI QIDQ1316652

Geoffrey P. Whittle, James G. Oxley

Publication date: 10 August 1994

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

set functionexcluded minorsgraph classespolymatroidset systemsrepresentation of polymatroids

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Related Items (2)

Decomposable polymatroids and connections with graph coloring ⋮ Unavoidable minors for connected 2-polymatroids

Cites Work

• Unnamed Item
• Decomposition of submodular functions
• The Redei function of a relation
• A geometric theory of hypergraph colouring
• THE CRITICAL PROBLEM FOR POLYMATROIDS

This page was built for publication: Some excluded-minor theorems for a class of polymatroids