  We study the concept of universal sets from the additive--combinatorial point
of view. Among other results we obtain some applications of this type of
uniformity to sets avoiding solutions to linear equations, and get an optimal
upper bound for the covering number of general sumsets.
