A Characterisation of Strict Matching Matroids

DOI10.1017/S0963548300000249zbMATH Open0793.05078MaRDI QIDQ4291198FDOQ4291198

Authors: Victor Bryant 

Publication date: 10 August 1994

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

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

zbMATH Keywords

transversal matroidmatching matroid

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

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

Cited In (4)

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

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)