CalcPath
Subjects
Dashboard
Diagnostic
Feedback
Search...
Matroids and Matchings
The structure that makes the greedy algorithm correct, and the matching theory of Hall and König that mirrors it.
0/13 mastered
1 / 13
How many non-empty subsets of
L
L
L
must be tested to verify Hall's condition when
∣
L
∣
=
4
|L| = 4
∣
L
∣
=
4
?
Review the explanation for this topic →
Your answer
Draw
Hint
Type your answer — press Enter to check
Enter your answer
s
( )
x
n
√
⌫
AC
7
8
9
+
4
5
6
−
1
2
3
×
0
.
a
b
Check
↵
÷
#13120
All topics
All Combinatorics topics