The matroids with the max-flow min-cut property Export

@article{citeulike:915566, abstract = {The max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded as a statement about the circuits and cocircuits using some fixed element of the cycle matroid of a graph. We show that, in general, a matroid has this property (in the integer form) if and only if it is binary and has no minor isomorphic to the dual of the Fano matroid.}, author = {Seymour, P. D.}, citeulike-article-id = {915566}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/0095-8956(77)90031-4}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6WHT-4D7K6KH-7G/2/2474751f4660583a53b0296b55918f2b}, doi = {10.1016/0095-8956(77)90031-4}, journal = {Journal of Combinatorial Theory, Series B}, keywords = {matroids, mfmc}, month = {}, number = {2-3}, pages = {189--222}, posted-at = {2006-10-27 22:40:40}, priority = {2}, title = {The matroids with the max-flow min-cut property}, url = {http://dx.doi.org/10.1016/0095-8956(77)90031-4}, volume = {23}, year = {1977} }

TY - JOUR ID - citeulike:915566 L3 - citeulike-article-id:915566 N2 - The max-flow min-cut theorem of Ford and Fulkerson (for undirected networks) may be regarded as a statement about the circuits and cocircuits using some fixed element of the cycle matroid of a graph. We show that, in general, a matroid has this property (in the integer form) if and only if it is binary and has no minor isomorphic to the dual of the Fano matroid. IS - 2-3 JF - Journal of Combinatorial Theory, Series B EP - 222 TI - The matroids with the max-flow min-cut property VL - 23 SP - 189 KW - matroids KW - mfmc AU - Seymour, PD PY - 1977/0// UR - http://dx.doi.org/10.1016/0095-8956(77)90031-4 ER -