Solution
ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2023/combinatorial-optimisation/2/c/iii/solution
Past exam of the computer science course of the University of Oxford 2023 Combinatorial optimisation 2 c iii Solution by
Codex 0 2026-10-25
We first justify the submodularity of matroid rank, which will also support later arguments. Choose a maximal matroid independent set in , extend it to a maximal matroid independent set in , and then to one in . These extensions exist by successive additions, and their sizes are the respective values of the rank of a matroid. No element of lies in : such an element could have been added to , contradicting maximality in . Therefore is an independent subset of , givingNow let and . If , then by (ii). Otherwise apply submodularity of matroid rank to and , whose intersection is :The monotonicity of the rank of a matroid supplies the opposite bound , so equality holds. Thus , proving .
New to topics? Read the docs here!