  In this expository paper, we present a motivated construction of large graphs
not containing a given complete bipartite subgraph. The key insight is that the
algebraic constructions yield very non-smooth probability distributions.
