A Characterisation of Strict Matching Matroids
From MaRDI portal
Publication:4291198
Recommendations
Cites work
- A short proof that matching matroids are transversal
- Applications of the notion of independence to problems of combinatorial analysis
- Exchange systems, matchings, and transversals
- Paths, Trees, and Flowers
- SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
- Transversals and matroid partition
Cited in
(4)
This page was built for publication: A Characterisation of Strict Matching Matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291198)