Jump to ContentJump to Main Navigation
Combinatorics, Complexity, and ChanceA Tribute to Dominic Welsh$
Users without a subscription are not able to see the full content.

Geoffrey Grimmett and Colin McDiarmid

Print publication date: 2007

Print ISBN-13: 9780198571278

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198571278.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 14 October 2019

TOWARDS A MATROID-MINOR STRUCTURE THEORY

TOWARDS A MATROID-MINOR STRUCTURE THEORY

Chapter:
(p.72) 5 TOWARDS A MATROID-MINOR STRUCTURE THEORY
Source:
Combinatorics, Complexity, and Chance
Author(s):

Jim Geelen

Bert Gerards

Geoff Whittle

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198571278.003.0005

This chapter surveys recent work aimed at generalizing the results and techniques of the Graph Minors Project of Robertson and Seymour to matroids. Some of the most interesting and apparently difficult conjectures in matroid theory concern minor-closed classes. Three fundamental conjectures of this type are described, the most famous of which is perhaps Rota's Conjecture. A minor-minimal matroid that does not belong to a given minor-closed class of matroids is an excluded minor for that class.

Keywords:   Graphs Minor Project, matroids, Rota's Conjecture

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .