Matroid intersection

Key takeaways

Matroid intersection belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Matroid intersection to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Matroid intersection from memory before moving on to harder problems.

Reference excerpt

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in graph theory and combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs. The matroid intersection theorem, due to Jack Edmonds, says that for any two matroids M 1 = ( E , I 1 ) {\displaystyle M_{1}=(E,{\mathcal {I}}_{1})} and M 2 = ( E , I 2 ) {\displaystyle M_{2}=(E,{\mathcal {I}}_{2})} we have

max I ∈ I 1 ∩ I 2 | I | = min A ⊆ E ( r 1 ( A ) + r 2 ( E ∖ A ) ) {\displaystyle \max _{I\in {\mathcal {I}}_{1}\cap {\mathcal {I}}_{2}}|I|=\min _{A\subseteq E}(r_{1}(A)+r_{2}(E\setminus A))}

where r 1 {\displaystyle r_{1}} and r 2 {\displaystyle r_{2}} are the respective rank functions of M 1 {\displaystyle M_{1}} and M 2 {\displaystyle M_{2}} . In other words, there is always a simple upper bound proof, consisting of a partitioning of the ground set amongst the two matroids, whose value (the sum of the respective ranks) equals the size of a maximum common independent set. Based on this theorem, the matroid intersection problem for two matroids can be solved in polynomial time using matroid partitioning algorithms.

Examples Let G = (U,V;E) be a bipartite graph. One may define a partition matroid MU on the ground set E, in which a set of edges is independent if no two of the edges have the same endpoint in U. Similarly one may define a matroid MV in which a set of edges is independent if no two of the edges have the same endpoint in V. Any set of edges that is independent in both MU and MV has the property that no two of its edges share an endpoint; that is, it is a matching. Thus, the largest common independent set of MU and MV is a maximum matching in G. Similarly, if each edge has a weight, then the maximum-weight independent set of MU and MV is a Maximum weight matching in G.

Algorithms There are several polynomial-time algorithms for weighted matroid intersection, with different run-times. The run-times are given in terms of n {\displaystyle n} - the number of elements in the common base-set, r {\displaystyle r} - the maximum between the ranks of the two matroids, T {\displaystyle T} - the number of operations required for a circuit-finding oracle, and k {\displaystyle k} - the number of elements in the intersection (in case we want to find an intersection of a specific size k {\displaystyle k} ).

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Matroid intersection

Start with the simplest possible case. Write down what Matroid intersection claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Matroid intersection before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Matroid intersection ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Matroid intersection

In research: Matroid intersection appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Matroid intersection in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Matroid intersection is common in secondary-school and first-year university syllabi. It links to neighbouring topics Combinatorial optimization, Matroid theory, so understanding it makes those chapters shorter.
In everyday life: Look for Matroid intersection outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Matroid intersection in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Matroid intersection means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Matroid intersection out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Matroid intersection in simple terms?

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maxi…

Why does Matroid intersection matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Matroid intersection?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Matroid intersection.