Transversal matroid intersections and related packings
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 11 (1) , 164-176
- https://doi.org/10.1007/bf01580384
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An unbounded matroid intersection polyhedronLinear Algebra and its Applications, 1977
- Blocking pairs of polyhedra arising from network flowsJournal of Combinatorial Theory, Series B, 1975
- Packing rooted directed cuts in a weighted directed graphMathematical Programming, 1974
- Matroids and the greedy algorithmMathematical Programming, 1971
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Transversals and matroid partitionJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and OnesCanadian Journal of Mathematics, 1964
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961