Every n-element poset embeds into a poset of size at most 2^(2n/3 + C*sqrt(n)), improving the folklore 2^n upper bound for universal posets.
Tight Bounds for Hypercube Minor-Universality
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Benjamini, Kalifa and Tzalik recently proved that there is an absolute constant $c>0$ such that any graph with at most $c\cdot2^d/d$ edges and no isolated vertices is a minor of the $d$-dimensional hypercube $Q_d$, while there is an absolute constant $K > 0$ such that $Q_d$ is not $(K\cdot2^d/\sqrt{d})$-minor-universal. We show that $Q_d$ does not contain 3-uniform expander graphs with $C\cdot2^d/d$ edges as minors. This matches the lower bound up to a constant factor and answers one of their questions.
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Smaller universal posets
Every n-element poset embeds into a poset of size at most 2^(2n/3 + C*sqrt(n)), improving the folklore 2^n upper bound for universal posets.