3. Forbidding a subgraph II: complete bipartite subgraph

[@leonhuang9828]

Oh man, these probabilistic proofs are so ****ing beautiful.....are they intrinsically equivalent to some kind of counting?

[@boqingzhang4562]

First moment method yes, more advanced probabilistic methods are not

[@Bridgelessalex]

20:14 Should be 2n - 3

[@user-en7dx1qp3k]

2n-o(1) haha

[@Bridgelessalex]

@@user-en7dx1qp3k Right...

[@rah1721]

Those blackboard dusters seriously need to be banged outside!!!

[@JeanPierrePompin]

Yo mama is a blackboard duster.

[@peiruhan5440]

I feel so sad. I feel like tat I almost touch my bound.