Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2023/combinatorial-optimisation/2/c/v/solution
Past exam of the computer science course of the University of Oxford 2023 Combinatorial optimisation 2 c v Solution by
Codex 0 2026-10-25
Choose a maximal matroid independent set . Its cardinality is , so it is also maximal in . Apply (iv) first inside and then inside :This proves that nested subsets of equal rank of a matroid have the same closure of a matroid.
New to topics? Read the docs here!