Skip to content
Preprint

Even smaller universal posets

Jul 2026 · 0 citations · 21 references
Mathematics

Abstract

We show that for every $\eta>0$ and sufficiently large $n$, there exists a poset of size $2^{(1+\eta)n/2}$ containing all the $n$-element posets as induced subposets. This improves a recent result of Bastide, Groenland and Nenadov. Our proof provides a labeling scheme preserving transitivity, inspired by the Boolean lattice. Among other tools, we use the Szemer\'edi Regularity Lemma.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.