Almost optimal dispersers

Research output: Contribution to journalArticlepeer-review

Abstract

A (K, ε) disperser is a bipartite graph G= (V1, V2, E) with the property that every subset A of V1 of cardinality at least K, has at least 1-ε fraction of the vertices of V2 as neighbors. Such graphs have many applications in derandomization. Saks, Srinivasan and Zhou presented an explicit construction of a (K = 2k, ε) disperser G: (V1 = [2n], V2, E) with an almost optimal degree D = poly(n/ε), for every k ≥ nω(1). We extend their result for every parameter k ≥ poly log (n/ε).

Original languageEnglish
Pages (from-to)123-145
Number of pages23
JournalCombinatorica
Volume22
Issue number1
DOIs
StatePublished - 2002

Fingerprint

Dive into the research topics of 'Almost optimal dispersers'. Together they form a unique fingerprint.

Cite this