| Matroids | Books | Bibliography | Software | People |
by Sandra Kingan (srkingan@psu.edu).
Matroids are an abstraction of several combinatorial objects, among them graphs and matrices. The word matroid was coined by Whitney in 1935 in his landmark paper "On the abstract properties of linear dependence". In defining a matroid Whitney tried to capture the fundamental properties of dependence that are common to graphs and matrices. Simple matroids, that is matroids without loops and parallel elements, are frequently called combinatorial geometries.
Matroid theory provides a framework in which problems in combinatorial optimization, operations research and graph theory become simpler to understand. Here is a list of some useful books related to Matroid Theory. For a good introduction to matroids see James Oxley's book Matroid Theory. Click here for a Postscript file containing an errata and update on conjectures, problems, and references.
A Toast to Matroids by W. T. Tutte .
Home Pages of people in Matroid Theory . This page has a growing list of mathematicians working in matroid theory.
Oid - a software system for experimenting with matroids. This page has information on Oid and links to other matroid and combinatorial software.
Matroid Bibliography:
A - D,
E - H,
I - L,
M - P,
Q - T,
U - Z.
Many thanks to James Oxley for generously allowing me to post on the web all the references in his book.
Matroid Links
Combinatorics Links
Vaek Chvátal's perfect papers
Math Links
| Matroids | Books | Bibliography | Software | People |
|