Random algebraic construction of extremal graphs
Combinatorics
2015-07-24 v5
Abstract
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.
Keywords
Cite
@article{arxiv.1409.3856,
title = {Random algebraic construction of extremal graphs},
author = {Boris Bukh},
journal= {arXiv preprint arXiv:1409.3856},
year = {2015}
}
Comments
8 pages