TOPICS
Search

Partition Matroid


A partition matroid is a matroid obtained from a set partition E_1,...,E_m of its finite ground set E and nonnegative integers b_1,...,b_m. A subset I subset= E is independent precisely when |I intersection E_j|<=b_j for each j (van Bevern et al. 2021, Garami 2026).


See also

Ground Set, Matroid, Matroid Coloring, Matroid Intersection, Set Partition

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.van Bevern, R.; Tsidulko, O. Yu.; and Zschoche, P. "Representative Families for Matroid Intersections, with Applications to Location, Packing, and Covering Problems." Disc. Appl. Math. 298, 110-128, 2021. https://doi.org/10.1016/j.dam.2021.03.014.

Cite this as:

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

Subject classifications