Smaller universal posets
Abstract
We show that there is a constant C>0 such that for each integer n≥ 1, there is a poset on at most 22n/3+Cn elements that contains each n-element poset as an (induced) subposet.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.