If something is a bottleneck it means that it is the limiting factor in the current set up. I.e. I would be able to make more matches for the boys (I still have more boys - surplus of boys), but there are no more girls - girls are the bottleneck.
|S| for all sets S that are a subset of L(H). Each S is some subset of the left side of the graph (as racun @račun525 correctly stated), and we are considering all such subsets. Basically we want to analyze every subset S of the left side of our graph and see if it to conforms to the condition that its size is is less than or equal to the number of nodes it is connected to on the other side; |S|
What is a bottleneck?
A bottleneck is where |S| > |E(S)| for some subset S ∈ G. This violates Hall's matching condition.
If something is a bottleneck it means that it is the limiting factor in the current set up. I.e. I would be able to make more matches for the boys (I still have more boys - surplus of boys), but there are no more girls - girls are the bottleneck.
Refer to video 2.11.7 here th-cam.com/video/HZLKDC9OSaQ/w-d-xo.html
good work, that's quality content. But please don't use Comic Sans MS, it's painful to read
no it's delightful
e seems to be the same as |E(S)|
what is S?
S is a subset of the left side of the graph. So that means it is a subset of girls. Which basically means any combination of girls can be S.
|S| for all sets S that are a subset of L(H).
Each S is some subset of the left side of the graph (as racun
@račun525 correctly stated), and we are considering all such subsets. Basically we want to analyze every subset S of the left side of our graph and see if it to conforms to the condition that its size is is less than or equal to the number of nodes it is connected to on the other side; |S|
please try making good videos on graph theory
Number Five, is it you? (Umbrella Academy)
Nice