---
id: matroid-isect
title: "Matroid Intersection"
author: Benjamin Qi
description: "?"
prerequisites:
frequency: 0
---

  * Tutorial
    * [CF Tutorial](https://codeforces.com/blog/entry/69287)
    * [Parametrized Algorithms Ch 12](http://parameterized-algorithms.mimuw.edu.pl/parameterized-algorithms.pdf)
    * [Illinois Lecture Notes](https://courses.engr.illinois.edu/cs598csc/sp2010/Lectures/Lecture17.pdf)
    * [Goemans](https://math.mit.edu/~goemans/18438F09/lec13.pdf)
      * describes partition matroid
  * Problems
    * [Honesty](https://www.urionlinejudge.com.br/judge/en/problems/view/2128)
      * Max Size Graphic + Colorful
    * [Coins](https://www.spoj.com/problems/COIN/)
      * Max Size Graphic + Colorful
    * [SERVERS](https://www.codechef.com/problems/SERVERS)
      * Max Size Graphic + Colorful
    * [Seollal](https://codeforces.com/contest/1284/problem/G)
      * Max Size Graphic + Colorful
    * [Pick Your Own Nim](https://codeforces.com/gym/102156/problem/D)
      * Max Size Linear + Colorful
    * [CCNCT2](https://www.codechef.com/problems/CNNCT2)
      * Max Size Graphic + Graphic
    * [Ambiguous Forest](https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3080)
      * Max Size Graphic + Graphic
    * [Rainbow Graph](https://open.kattis.com/problems/rainbowgraph)
      * Min Weight Graphic + Colorful
      * [NAIPC 2018 Sols](http://serjudging.vanb.org/?p=1165)
      * [Arup Guha Sol](http://www.cs.ucf.edu/~dmarino/progcontests/mysols/northamerica/2018/g.java)
    * [HAMEL](https://www.codechef.com/problems/HAMEL)
      * Partition into 2 MST's, then construct
    * [TST](https://dmoj.ca/problem/dmopc19c3p6)
      * Partition into 3 MST's
