The maximum number of edges in a graph with no Kt minor is well-understood, and the extremal graphs are pseudo-random. The same is true if Kt is replaced by a graph H of order t, for most graphs H. But if H is a disjoint union of complete graphs the situation changes : the extremal graphs are "the opposite" of pseudo-random.