Matroid Applications
Matroid Applications
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
This volume, the third in a sequence that began with The Theory of Matroids (1986) and Combinatorial Geometries (1987), concentrates on the applications of matroid theory to a variety of topics from geometry (rigidity and lattices), combinatorics (graphs, codes, and designs) and operations research (the greedy algorithm).
- A comprehensive and accessible account of the subject
- Includes an exhaustive reference list
- Includes exercises and open problems at the end of each chapter
Reviews & endorsements
"...will be most useful to researchers in combinatorics and related areas and to graduate students who want to learn about the most recent advances in the subject. The book provides a rich collection of exercises to aid the latter. It is to the credit of the authors and the editor that the book provides smooth and enjoyable reading at a very high level of exposition." Peter Orlik, SIAM Review
Product details
September 2009Paperback
9780521119672
376 pages
229 × 152 × 20 mm
0.55kg
Available
Table of Contents
- List of contributors
- Preface
- 1. Matroids and rigid structures Walter Whiteley
- 2. Perfect matroid designs M. Deza
- 3. Infinite matroids James Oxley
- 4. Matroidal families of graphs J. M. S. Simões-Pereira
- 5. Algebraic aspects of partition lattices Ivan Rival and Miriam Stanford
- 6. The Tutte polynomial and its applications Thomas Brylawski and James Oxley
- 7. Homology and shellability of matroids and geometric lattices Anders Björner
- 8. Introduction to greedoids Anders Björner and Günter M. Ziegler
- Index.
