Uniformity of extremal graph-codes
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.
Fields of Study & Subjects
Limits and Structures in Graph Theory
Advanced Combinatorial Mathematics
Analytic Number Theory Research
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 3 February 2026
- Document type
- Preprint