Defining matroids through sequential selection

DOI10.1016/J.EJC.2004.11.006MaRDI QIDQ854847zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 7 December 2006

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2004.11.006

zbMATH Keywords

blockermatroidclutterpartial transversalsequential transversal

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Transversal (matching) theory (05D15)

Recommendations

• scientific article; zbMATH DE number 1028231
• The notion and basic properties of M-transversals
• Constructive characterizations of 3-connected matroids of path width three
• scientific article; zbMATH DE number 4097397
• Basis pair graphs of transversal matroids are connected

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• A simple approach to some basic results in matroid theory
• Transversals and matroid partition

This page was built for publication: Defining matroids through sequential selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854847)