TOPICS
Search

Partition Matroid


A partition matroid is a matroid obtained by partitioning its ground set E into disjoint blocks E_1,...,E_m and choosing nonnegative integers b_1,...,b_m. A subset I subset= E is independent precisely when |I intersection E_j|<=b_j for each j (Garami 2026).


See also

Ground Set, Matroid, Matroid Coloring, Matroid Intersection

Explore with Wolfram|Alpha

References

Garami, B. "A Note on the List Chromatic Number of Two Matroids." 5 Oct 2026. https://arxiv.org/abs/2610.07318.

Cite this as:

Weisstein, Eric W. "Partition Matroid." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PartitionMatroid.html

Subject classifications