The Electronic Library of Mathematics
Mathematical Monographs


For fastest access: Choose your nearest mirror site!


MATROID DECOMPOSITION


by Klaus Truemper <klaus@utdallas.edu>



Revised edition © 1998 Klaus Truemper
Paper version originally published 1992 by Academic Press, Boston (USA)
Revised edition published 1998 by Leibniz, Plano, Texas (USA)
ISBN 0-9663554-0-7 for the revised paper edition

Abstract: Matroids were first defined in 1935 as an abstract generalization of graphs and matrices. In the subsequent two decades, comparatively few results were obtained. But starting in the mid-1950s, progress was made at an ever-increasing pace.

As this book is being written, a large collection of deep matroid theorems already exists. These results have been used to solve difficult problems in diverse fields such as civil, electrical, and mechanical engineering, computer science, and mathematics.


Download: All parts can be downloaded in compressed PostScript format by clicking on the chapter titles given below.

Front Cover, Spine, Back Cover

Title Pages and Copyright Statement

Table of Contents

Preface

Chapter 1: Introduction

Chapter 2: Basic Definitions

Chapter 3: From Graphs to Matroids

Chapter 4: Series-Parallel and Delta-Wye Constructions

Chapter 5: Path Shortening Technique

Chapter 6: Separation Algorithm

Chapter 7: Splitter Theorem and Sequences of Nested Minors

Chapter 8: Matroid Sums

Chapter 9: Matrix Total Unimodularity and Matroid Regularity

Chapter 10: Graphic Matroids

Chapter 11: Regular Matroids

Chapter 12: Almost Regular Matroids

Chapter 13: Max-Flow Min-Cut Matroids

References

Author Index

Subject Index


Permission is granted to inviduals to print single copies of the book for personal use without charge by the publisher. Such printing must always include the copyright information, which is contained in the title section.
The files are formatted for printing on paper of 8 1/2 inches width and 11 inches length. Subsequent reduction to a format of 7 inches width and 9 1/4 inches length is recommended but not mandatory.
Licenses for commercial printing of the book are available from:
Leibniz
2304 Cliffside Drive
Plano, Texas 75023-5337
U.S.A.

Page created 9 May 2000.  © 2000 ELibM for this page.