Uniformity of extremal graph-codes
Combinatorics
2026-04-14 v2
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.
Cite
@article{arxiv.2602.03298,
title = {Uniformity of extremal graph-codes},
author = {Noé de Rancourt and Pandelis Dodos and Konstantinos Tyros},
journal= {arXiv preprint arXiv:2602.03298},
year = {2026}
}