Abstract
LetB,B′ be bases of a matroid, withX ⊂ B, X′ ⊂ B′. SetsX,X′ are asymmetric exchange if(B − X′) ⋃ X′ and(B′ − X′) ⋃ X are bases. SetsX,X′ are astrong serial B-exchange if there is a bijectionf: X → X′, where for any ordering of the elements ofX, sayx i ,i = 1, ⋯, m, bases are formed by the sets B0 = B, Bi = (Bi−1 − xi) ⋃f(x i), fori = 1, ⋯, m. Any symmetric exchangeX,X′ can be decomposed by partitioning X = ⋃ mi=1 Yi, X′ = ⋃ mi=1 Yi, X′, where (1) bases are formed by the setsB 0 =B, B i = (B i−1 −Y i )⋃ Y ′ i ; (2) setsY i ,Y ′ i are a strong serialB i−1 -exchange; (3) properties analogous to (1) and (2) hold for baseB′ and setsY ′ i ,Y i .
Similar content being viewed by others
References
R.A. Brualdi, “Comments on bases in dependence structures”,Bulletin of the Australian Mathematical Society 1 (1969) 161–167.
T.H. Brylawski, “Some properties of basic families of subsets”,Discrete Mathematics 6 (1973) 333–341.
H.H. Crapo and G.-C. Rota,Combinatorial geometries (M.I.T. Press, Cambridge, Mass., 1970) preliminary edition.
L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).
C. Greene, “A multiple exchange property for bases”,Proceedings of the American Mathematical Society 39 (1973) 45–50.
H. Whitney, “On the abstract properties of linear dependence”,American Journal of Mathematics 57 (1934) 509–533.
D.R. Woodall, “An exchange theorem for bases of matroids”,Journal of Combinatorial Theory (B) 16 (1974) 227–228.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gabow, H. Decomposing symmetric exchanges in matroid bases. Mathematical Programming 10, 271–276 (1976). https://doi.org/10.1007/BF01580672
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01580672