Matroids and linking systems

DOI10.1016/0095-8956(79)90011-XzbMath0414.05015MaRDI QIDQ599061

Alexander Schrijver

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

matroidslinking systems

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

König's theorem and bimatroids, Finding optimal minors of valuated bimatroids, Shapley's conjecture on the cores of abstract market games, Pseudomatroids, Bimatroids and Gauss decomposition, Combinatorial dynamical system theory: General framework and controllability criteria, Reliable assignments of processors to tasks and factoring on matroids, Legendre duality in combinatorial study of matrix pencils, A Matroid Abstraction of the Bott–Duffin Constrained Inverse, Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems, A flow model based on polylinking system, The graph bottleneck identity, Induction of M-convex functions by linking systems, Eigensets and power products of a bimatroid, Multicommodity flows and cuts in polymatroidal networks, The Tutte polynomial of a ported matroid, Some recent results in combinatorial approaches to dynamical systems, Combinatorial analysis. (Matrix problems, choice theory), Note on binary simplicial matroids, The excluded minors for GF(4)-representable matroids, A Tutte decomposition for matrices and bimatroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dependence graph for bases in matroids
• An exchange theorem for bases of matroids
• Applications of Menger's graph theorem
• A proof of the linkage theorem
• Gammoids and transversal matroids
• SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
• An Exchange Theorem for Independence Structures
• EXTENSIONS OF MENGER'S THEOREM
• An Introduction to Matroid Theory
• Transversals and matroid partition
• The Linking of Sets in Graphs
• Independence Spaces and Combinatorial Problems
• Admissible Mappings between Dependence Spaces
• On the Vector Representation of Matroids
• On Matroid Theorems of Edmonds and Rado
• A characterization of transversal independence spaces
• Induced Matroids
• Menger's Theorem and Matroids
• On a Class of Matroids Arising From Paths in Graphs
• A Multiple Exchange Property for Bases
• A THEOREM ON INDEPENDENCE RELATIONS