An Introduction to Matroid Theory

DOI10.2307/2319608zbMath0275.05018OpenAlexW4249577428WikidataQ55982137 ScholiaQ55982137MaRDI QIDQ5183514

Robin J. Wilson

Publication date: 1973

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2319608

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (15)

Complete bipartite factorisations by complete bipartite graphs ⋮ General geometric lattices and projective geometry of modules ⋮ Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids ⋮ Matroids and linking systems ⋮ Parametric matroid interdiction ⋮ Matroids and the Minimum Rank Problem for Matrix Patterns ⋮ Covering cycle matroid ⋮ Matroidal structure of rough sets from the viewpoint of graph theory ⋮ Transversal theory and F-products ⋮ On a definition of connected sets of a matroid ⋮ A self-dual language for graph theory ⋮ Comparability graphs and a new matroid ⋮ Matroids, generalized networks, and electric network synthesis ⋮ Use of matroid theory in operations research, circuits and systems theory ⋮ Matroid Theory for Algebraic Geometers

This page was built for publication: An Introduction to Matroid Theory