Matroid Applications

This volume deals with the applications of matroid theory to a variety of topics.

Neil White (Edited by)

9780521381659, Cambridge University Press

Hardback, published 5 March 1992

376 pages
24.1 x 16.1 x 2.4 cm, 0.672 kg

"...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

This volume, the third in a sequence that began with The Theory of Matroids and Combinatorial Geometries, concentrates on the applications of matroid theory to a variety of topics from engineering (rigidity and scene analysis), combinatorics (graphs, lattices, codes and designs), topology and operations research (the greedy algorithm). As with its predecessors, the contributors to this volume have written their articles to form a cohesive account so that the result is a volume which will be a valuable reference for research workers.

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.

Subject Areas: Combinatorics & graph theory [PBV]