This page contains links to articles that are about techniques for finding subsets with given properties of sets such as , , , the complete graph on vertices, the discrete cube, or the set of all subsets of . It is not about finding structured subsets such as subgroups or subspaces, so the techniques have a combinatorial flavour.
Finding small nets Quick description ( A -net of a metric space is a subset such that for every there exists such that . It is often useful to have a small -net for a metric space. This article discusses a few techniques for finding them, giving particular reference to an idea that can be summarized by the following slogan: a maximal separated set is a net. )