A Characterisation of Strict Matching Matroids

DOI10.1017/S0963548300000249MaRDI QIDQ4291198zbMATHFDO

Authors 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)

Recommendations

• A CHARACTERIZATION OF STRICT MATCHING MATROIDS
• Strict matching matroids and matroid algorithms
• scientific article; zbMATH DE number 4025456
• scientific article; zbMATH DE number 3150
• Characterizing matchings as the intersection of matroids

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)

• Structural properties of matroid matchings
• Transversal and cotransversal matroids via their representations
• Strict matching matroids and matroid algorithms
• A CHARACTERIZATION OF STRICT MATCHING MATROIDS

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)