Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of “abstract pivots”. The main example is the Edmonds–Fulkerson partition theorem, which is applied to prove a number of generalized exchange properties for bases.
No takes yet. Share an insight, caveat, or question.
Greene et al. (1975) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: