Defining matroids through sequential selection

DOI10.1016/J.EJC.2004.11.006zbMATH Open1118.05010OpenAlexW2117379790MaRDI QIDQ854847FDOQ854847

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

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

zbMATH Keywords

blockermatroidclutterpartial transversalsequential transversal

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transversals and matroid partition
• A simple approach to some basic results in matroid theory

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)