Hostname: page-component-7d684dbfc8-mqbnt Total loading time: 0 Render date: 2023-09-26T10:50:45.789Z Has data issue: false Feature Flags: { "corePageComponentGetUserInfoFromSharedSession": true, "coreDisableEcommerce": false, "coreDisableSocialShare": false, "coreDisableEcommerceForArticlePurchase": false, "coreDisableEcommerceForBookPurchase": false, "coreDisableEcommerceForElementPurchase": false, "coreUseNewShare": true, "useRatesEcommerce": true } hasContentIssue false

# 7 - Other matroids

Published online by Cambridge University Press:  05 November 2012

## Summary

Matroids are an important generalization of graphs and matrices; graphic and representable matroids have been the focus of much of the text. But other important combinatorial structures also have interpretations as matroids. In this chapter, we concentrate on two well-studied applications: transversalmatroids (which arise from bipartite graphs) and hyperplane arrangements in ℝn, which are closely related to representable matroids.

Transversal matroids

Finding matchings in bipartite graphs is an extremely important and well-studied topic in combinatorics. For instance, the job assignment problem introduced in Example 1.20 in Chapter 1 asks you to determine which applicants to hire for a collection of jobs. This motivates the notion of a transversal matroid, a matroid associated with matchings in a bipartite graph. These matroids were defined in Example 1.20, and Theorem 7.2 asserts the collections of vertices that can be matched to satisfy the independent set axioms. In Chapter 1, we postponed the proof until “later.” Now, it's later.

In an effort to make this chapter self-contained (and to spare you the trouble of leafing back to Chapter 1), we remind you of all the relevant definitions. Let G be a bipartite graph with vertex bipartition V = XY. Recall a subset of edges N is called a matching if no two edges ofN share any vertex. We writeN = (I, J) for IX and JY for the vertices that the matching N uses in X and Y, respectively.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2012

## Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

# Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

• Other matroids
• Book: Matroids: A Geometric Introduction
• Online publication: 05 November 2012
• Chapter DOI: https://doi.org/10.1017/CBO9781139049443.008
Available formats
×

# Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

• Other matroids
• Book: Matroids: A Geometric Introduction
• Online publication: 05 November 2012
• Chapter DOI: https://doi.org/10.1017/CBO9781139049443.008
Available formats
×

# Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

• Other matroids
• Book: Matroids: A Geometric Introduction
• Online publication: 05 November 2012
• Chapter DOI: https://doi.org/10.1017/CBO9781139049443.008
Available formats
×