Send or share

Matroid Theory (Hardcover, 2nd Revised edition)

* 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.
Reviews from previous edition:
"It includes more background, such as finite fields and finite projective and affine geometries, and the level of the exercises is well suited to graduate students. The book is well written and includes a couple of nice touches ... this is a very useful book. I recommend it highly both as an introduction to matroid theory and as a reference work for those already seriously interested in the subject, whether for its own sake or for its applications to other fields." -- AMS Bulletin
"Whoever wants to know what is happening in one of the most exciting chapters of combinatorics has no choice but to buy and peruse Oxley's treatise." -- The Bulletin of Mathematics
"This book is an excellent graduate textbook and reference book on matroid theory. The care that went into the writing of this book is evident by the quality of the exposition." -- Mathematical Reviews
R6,063

Pay from as little as R1,515.75Learn more

payflex-widget-image
Discovery Miles60630
Mobicred@R568pm x 12* Mobicred Info

Non-Returnable

Free Delivery

Free Delivery

Delivery Advice

Ships in 10 - 15 working days

Toggle WishListAdd to wish list
Review this Item

Product Description

* 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.
Reviews from previous edition:
"It includes more background, such as finite fields and finite projective and affine geometries, and the level of the exercises is well suited to graduate students. The book is well written and includes a couple of nice touches ... this is a very useful book. I recommend it highly both as an introduction to matroid theory and as a reference work for those already seriously interested in the subject, whether for its own sake or for its applications to other fields." -- AMS Bulletin
"Whoever wants to know what is happening in one of the most exciting chapters of combinatorics has no choice but to buy and peruse Oxley's treatise." -- The Bulletin of Mathematics
"This book is an excellent graduate textbook and reference book on matroid theory. The care that went into the writing of this book is evident by the quality of the exposition." -- Mathematical Reviews

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Oxford UniversityPress

Country of origin

United Kingdom

Series

Oxford Graduate Texts in Mathematics, 21

Release date

February 2011

Availability

Expected to ship within 10 - 15 working days

First published

April 2011

Authors

Dimensions

238 x 156 x 45mm (L x W x T)

Format

Hardcover

Pages

704

Edition

2nd Revised edition

ISBN-13

978-0-19-856694-6

Barcode

9780198566946

Categories

LSN

0-19-856694-8

COPYRIGHT © 2026 AFRICA ONLINE RETAIL (PTY)LTD. ALL RIGHTS RESERVED. Khutaza Park, 27 Bell Crescent, Westlake Business Park. PO Box 30836, Tokai, 7966, South Africa. info@loot.co.za

All prices displayed are subject to fluctuations and stock availability as outlined in our Terms & Conditions