Transversal matroid intersections and related packings

DOI10.1007/BF01580384zbMATH Open0354.90085OpenAlexW1965085017MaRDI QIDQ4126086FDOQ4126086

Authors: David B. Weinberger 

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cites Work

• On the Problem of Decomposing a Graph into n Connected Factors
• Transversals and matroid partition
• Minimum partition of a matroid into independent subsets
• Blocking and anti-blocking pairs of polyhedra
• Matroids and the greedy algorithm
• Title not available (Why is that?)
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Packing rooted directed cuts in a weighted directed graph
• Title not available (Why is that?)
• An unbounded matroid intersection polyhedron
• Blocking, antiblocking, and pairs of matroids and polymatroids
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
• Blocking pairs of polyhedra arising from network flows
• Title not available (Why is that?)

Cited In (2)

• Integral decomposition in polyhedra
• An unbounded matroid intersection polyhedron

This page was built for publication: Transversal matroid intersections and related packings

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