Abstract
Seymour proved that the set of odd circuits of a signed binary matroid (M, ∑) has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to (M(K4),E(K4)). We give a shorter proof of this result. © 2002 Elsevier Science (USA).
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Guenin, B. (2002). A short-proof of seymour’s characterization of the matroids with the Max-Flow Min-Cut property. Journal of Combinatorial Theory. Series B, 86(2), 273–279. https://doi.org/10.1006/jctb.2002.2127
Readers over time
Readers' Seniority
Readers' Discipline
