Uniformity of extremal graph-codes

It is an important fact that extremal discrete structures – that is, discrete structures of maximal size among those that avoid certain configurations – exhibit strong pseudorandom behavior. We present instances of this phenomenon in the context of \emph{graph-codes}, a notion put forth recently by Alon, as well as on problems related to the density polynomial Hales–Jewett conjecture.