Abstract
An algorithm is presented for determining whether or not a matroid is a transversal matroid. If the matroid is a transversal matroid, the algorithm furnishes an explicit determination of the maximal presentation (which therefore must be unique). From this we obtain necessary and sufficient conditions for a matroid to be a transversal matroid and two characterizations of the presentations of a given transversal matroid. We also evaluate the cardinalities of the members of presentations of a transversal matroid in terms of the cardinalities of the members of the maximal presentation and the ranks of the complements of each. Numerous other consequences are derived.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
