zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Matroid theory. (English) Zbl 0784.05002
Oxford Graduate Texts in Mathematics 3. Oxford Science Publications. Oxford: Oxford University Press (ISBN 0-19-853563-5/hbk). xi, 532 p. £45.00 (1992).

There are two fundamental problems which the author had to face in writing Matroid Theory. The first was the decision of what material to leave out and the second was how to organize what was left. This could be said of almost any book, but with matroid theory both problems are quite difficult, particularly the second. There are over a half a dozen different ways to approach the subject. Of these, three lead to three fundamentally different ways of interpreting a matroid and correspond to three major early papers in the field: H. Whitney [On the abstract properties of linear dependence, Am. J. Math. 57, 509-533 (1935; Zbl 0012.00404)] (the defining paper); W. T. Tutte [A homotopy theorem for matrois.I,II. Trans. Am. Math. Soc. 88, 144-174 (1958; Zbl 0081.173)] and H. H. Crapo and G.-C. Rota [On the foundations of combinatorial theory: Combinatorial geometries, MIT Press (1970; Zbl 0216.021)].

Each of these three points of view motivates its own body of results and each has played a major role in the growth of matroid theory. In the first part of this text, Chapters 1-6, the author does an admirable job of balancing these three approaches in an excellent introduction to the basics of matroid theory. As the author states, these chapters with some deletion could be the basis of a one semester introduction to matroid theory. The remaining chapters are a selection of advanced topics from matroid theory. (No single text can cover all of matroid theory.) The titles of these chapters are: Chapter 7: Construction; Chapter 8: Higher connectivity, Chapter 9: Binary matroids, Chapter 10: Ternary matroids, Chapter 11: The splitter theorem, Chapter 12: Submodular functions and matroid union, Chapter 13: Regular matroids, Chapter 14: Unsolved problems.

These topics are admirably orchestrated so that the author has been able to achieve the following goal which he had set for himself: “One of the main tasks of the second half of the book is to present these proofs in reasonably full detail. I have never enjoyed reading proofs in which numerous intermediate steps are left to the reader, so I have tried to avoid writing such proofs.” The book includes a large variety of very good exercises (over 500) with a great variation in difficulty, and closes with a full chapter of the questions in fields which remain open.

The reviewer cannot as yet claim to have read the entire 500 pages of this text, but what he has read has been so well written, he is sure that within the next semester or so he will have read it from cover to cover.

05-02Research monographs (combinatorics)
05B35Matroids, geometric lattices (combinatorics)