We ﬁnd a sharp combinatorial bound for the metric entropy of sets in Rn and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisﬁes the uniform Central Limit Theorem if the square root of its combinatorial dimension is integrable. 2. The uniform entropy is equivalent to the combinatorial dimension under minimal regularity. Our method also constructs a nicely bounded coordinate section of a symmetric convex body in Rn . .