Date of Original Version
Abstract or Description
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.
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License.
Bulletin of the London Mathematical Society, accepted.