A Characterisation of Strict Matching Matroids

DOI10.1017/S0963548300000249zbMath0793.05078MaRDI QIDQ4291198

Victor Bryant

Publication date: 10 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

transversal matroidmatching matroid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• A short proof that matching matroids are transversal
• SOME RESULTS ON TRANSVERSAL MATROIDS AND CONSTRUCTIONS FOR IDENTICALLY SELF-DUAL MATROIDS
• Paths, Trees, and Flowers
• Transversals and matroid partition
• Applications of the notion of independence to problems of combinatorial analysis
• Exchange systems, matchings, and transversals

This page was built for publication: A Characterisation of Strict Matching Matroids