Sorry for delay in replying. We want to show that m(k) the smallest number of edges in the in a k-uniform hypergraph that is not 2-colorable is greater than or equal to 2^(k-1). The complement of there being greater than or equal to 2^(k-1) edges is that there are at most 2^(k-1) edges. That is what us used to bound the probability at that point.
This is perfect! Helped me a lot!
11:40 The compliment of what..?
Nevermind. The answer is at 4:55
Sorry for delay in replying. We want to show that m(k) the smallest number of edges in the in a k-uniform hypergraph that is not 2-colorable is greater than or equal to 2^(k-1). The complement of there being greater than or equal to 2^(k-1) edges is that there are at most 2^(k-1) edges. That is what us used to bound the probability at that point.
Absolutely gorgeous!
The professor's not bad either
fr i cant concentrate🥲