Matroid Theory

Spring 2008

To the readings and problems | the presentations page.

This course is an introduction to the basic concepts and constructions of matroid theory and to the chief examples. This is not an introductory graduate course. The absolute minimum requirement is a good understanding of abstraction and a solid modern algebra background (as from a graduate course in that).

The course is based on the textbook:

James Oxley, Matroid Theory, Oxford University Press, 1992.

The book doesn't cover everything – a good thing, if you prefer your book to be less than 1000 pages long – but it is an exceptionally nice graduate textbook. The book will be on reserve in the Reserve Reading Room (on 2-hour loan).

We meet on M,W,F at noon in LN-2206. There is also a *student problem session* (sometimes a makeup class) on Thursday at 1:15 in LN-2205.

Special **makeup classes**:

Thursday Feb. 7, 1:15 - 2:15 in LN-2205.

Thursday Mar. 13, 1:15 - 2:15 in LN-2206.

Tuesday Apr. 1 and **Tuesday Apr. 8**, 1:15 - 2:15 in **LN-2205**: the combinatorics seminar with T.Z.'s report on current trends in matroid theory from the Baton Rouge AMS meeting.

**Thursday Apr. 17**, 1:15 - 2:15 in LN-2206.

**Thursday Apr. 24**, 1:15 - 2:15 in LN-2206.

**Thursday May 1**, 1:15 - 2:15 in LN-2206, **instead of** Friday 5/2.

Short outline:

- Oxley, Chapters 1-9, 11 (part), 13 (part). Almost all of Chapters 1-4 is fundamental.

Sections that we omit or skim over very lightly are: 1.8, 6.7, 6.8. 7.3, 8.4, 9.3. - Zaslavsky, "The Möbius function and the characteristic polynomial", Chapter 7 of Combinatorial Geometries, ed. by Neil White.

An outline of the initial material from the course is available here, as a PDF file. It doesn't go far or have much detail. It probably has errors. I will be happy to hear of any you find, no matter how trivial.

I expect you, the students, to study the material and to work on as many of the exercises as you can. I'll collect written work every week or two and return it with comments, for your edufication. There will not be any tests! I'll meet separately with each student frequently to discuss your progress and any questions you may have.

ASSIGNMENTS: Click here for

Here is Oxley's PDF file of corrections for the book as of 2005. Some of them are simple errors, but many are improved proofs, updates on conjectures, and so on. See Oxley's homepage for his short introduction to matroid theory.

Here are additional corrections and comments of my own.

What is a matroid, really? A matroid is not one thing; it is a complex of properties, no one of them most important. Here is a description of a function, which could be said just as well of a matroid.

A function was not, for Riemann, a mere set of points; still less was it any of its pictorial representations as a graph or a table; and still less a collection of expressions involving algebraic formulas. ... What then, was a function? It was anobject, from which none of its attributes could properly be detached. Riemann saw a function the way chess grandmasters are said to see a game, all at once, as a unified whole, aGestalt.– Prime Obsession by John Derbyshire, 2003, p. 129.

Matroid theory originated as an abstract study of the properties of linear dependence of finite sets of vectors in a vector space. The idea was to forget the details of linear dependence relations and only remember which sets of vectors are linearly dependent. There are some nice axioms to describe a property abstracting linear dependence – let's call it ``dependence'' – that allow one to define (purely abstractly) such basic vector-space properties dimension (we call it ``rank''), linearly closed sets, bases, and much more. The main thing they don't allow one to do is to find the vector space, because the axioms admit examples that cannot possibly come from vectors. A set with a list of dependent subsets (or an equivalent, like a rank function or a list of bases) is called a matroid.

Another origin of matroid theory is in graph theory. There is a natural matroid on a graph: the elements of the matroid are the edges of the graph and the dependent subsets are the edge sets that contain a circuit (a.k.a. cycle or closed path). Many interesting and important graph properties are naturally expressed in terms of matroids. For instance, a spanning tree of a graph is the same as a basis of the graphic matroid. The chromatic polynomial of a graph (this counts proper colorings; it appeared in an attempt to prove the Four-Color Theorem) is another thing that is essentially matroidal, although the connection is less simple. Graph connectivity is closely related to matroids, although here there are some complications.

There are many other sources of matroid theory and examples, including hyperplane arrangements (which have their own analogs of chromatic polynomials), transversals, and whatever.

To the readings and problems | the presentations page.

To my home page.