The order dimension of the complete graph Original Research Article

We show that the order dimension of the complete graph on n vertices is the smallest integer t for which there are n antichains in the subset lattice of [t - 1] that do not contain [t - 1] or two sets whose union is [t - 1].