Jump to ContentJump to Main Navigation
Matroid Theory$
Users without a subscription are not able to see the full content.

James Oxley

Print publication date: 2011

Print ISBN-13: 9780198566946

Published to Oxford Scholarship Online: December 2013

DOI: 10.1093/acprof:oso/9780198566946.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 24 July 2019

Constructions

Constructions

Chapter:
(p.251) 7 Constructions
Source:
Matroid Theory
Author(s):

James Oxley

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

This chapter discusses several different ways of using some given set of matroids to form a new matroid. The chapter is organized as follows. Section 7.1 looks at three closely related ways of joining two matroids with exactly one common element. Section 7.2 investigates the operations of extension and coextension, which reverse the operations of deletion and contraction, respectively. Section 7.3 uses the techniques of Section 7.2 to examine the relationship between two matroids such that every flat of one is a flat of the other. Finally, Section 7.4 discusses an interesting non-commutative operation for joining two matroids.

Keywords:   matroids, connection, extension, coextension, interesting non-commutative operation

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 .