An (N, M, D, K, e)-disperser is a bipartite graph with N nodes on the left side, each with degree D, and M nodes on the right side, such that every subset of K nodes on the left side is connected to more than (1 − e) fraction of the nodes on the right (i.e. more than (1 − e)M nodes).