Work

Uniformity of extremal graph-codes

Year: 2026
Type: preprint
Abstract: 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.
Open Access status: green
OpenAlex ID: W7127613329
Cites:
Cited by:
Related to: