Carnegie Mellon University
Browse
file.pdf (138.97 kB)

Random algebraic construction of extremal graphs

Download (138.97 kB)
journal contribution
posted on 2015-07-23, 00:00 authored by Boris Bukh

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.

History

Date

2015-07-23

Usage metrics

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC