A note on the separation problem for the matching matroid

DOI10.1016/0012-365X(84)90094-3zbMath0555.05024OpenAlexW2071484462MaRDI QIDQ760436

Alain Prodon

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90094-3

zbMATH Keywords

digraphseparation problemmatching matroidminimum-capacity cut

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Paths, Trees, and Flowers
• Transversals and matroid partition
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the separation problem for the matching matroid