KnowraMatroidLinked fromLinked fromThe 9 pages that link to Matroid, each with the reason it gives.All 9Broader topic 1Related 3Narrower topic 4Compared with 1Incidence matrixRelated: Incidence matrices help represent graphic matroids and their cycle dependencies.Greedy algorithmBroader topic: Matroid structure gives a broad condition under which sorting by weight and choosing greedily is optimal.Combinatorial optimizationRelated: Matroid structure explains why greedy algorithms solve some discrete optimization problems exactly.Tree (graph theory)Narrower topic: The edge sets of forests form the graphic matroid of a graph.Spanning treeNarrower topic: The edge sets of spanning trees are the bases of a graphic matroid.Partition of a setCompared with: Matroid partitions concern covering elements by independent sets, not disjoint blocks.Kruskal's algorithmNarrower topic: The graphic matroid explains why greedy edge selection finds a minimum spanning tree.Richard M. KarpRelated: Matroid theory connects greedy optimization with the combinatorial structures Karp studied.Steinitz exchange lemmaNarrower topic: Matroid exchange generalizes the independent-set replacement pattern beyond vector spaces.