Matroid Theory -

Matroid Theory



Or 4 payments of $39.60 with

delivery message Free delivery for orders over $49.99

Add to Favourites
Delivered in 10 - 14 days
Available for Click and Collect
* What is the essence of the similarity between linearly independent sets of columns of a matrix and forests in a graph? * Why does the greedy algorithm produce a spanning tree of minimum weight in a connected graph? * Can we test in polynomial time whether a matrix is totally unimodular?Matroid theory examines and answers questions like these. Seventy-five years of study of matroids has seen the development of a rich theory with links to graphs, lattices, codes, transversals, and projective geometries. Matroids are of fundamental importance in combinatorial optimization and their applications extend into electrical and structural engineering.This book falls into two parts: the first provides a comprehensive introduction to the basics of matroid theory, while the second treats more advanced topics. The book contains over seven hundred exercises and includes, for the first time in one place, proofs of all of the major theorems in the subject. The last two chapters review current research and list more than eighty unsolved problems along with a description of the progress towards their solutions.

Product code: 9780199603398

ISBN 9780199603398
Dimensions (HxWxD in mm) H232xW157xS40
Series Oxford Graduate Texts in Mathematics
No. Of Pages 704
Publisher Oxford University Press
Edition 2nd Revised edition
This major revision of James Oxley's classic Matroid Theory provides a comprehensive introduction to the subject, covering the basics to more advanced topics. With over 700 exercises and proofs of all relevant major theorems, this book is the ideal reference and class text for academics and graduate students in mathematics and computer science.