Matroids and Matchings
0/84 solved1 / 84
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
How many bases does the uniform matroid have?
Your answer
comb-mat-20All Combinatorics chaptersAbout these 84 questions
The structure that makes the greedy algorithm correct, and the matching theory of Hall and König that mirrors it. This set covers the chapter Matroids and Matchings in Combinatorics: 27 easy, 44 medium and 13 hard questions, each graded instantly with a hint and a full step-by-step solution. Progress is saved in this browser only.
- Independence: the Axioms and Their Equivalents — 13 questions
- Where Matroids Come From — 14 questions
- Greedy, Intersection and the Limits of Sweeping — 13 questions
- Matchings, Alternating Paths and Berge's Theorem — 15 questions
- Hall's Theorem and the König Equivalence — 13 questions
- Algorithms, Blossoms and the Min–Max Pattern — 16 questions