Matroid Applications [Paperback]

This volume deals with the applications of matroid theory to a variety of topics.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).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).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).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. ...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