Smaller universal poset
Skip to main content
eScholarship
Open Access Publications from the University of California

Combinatorial Theory

Combinatorial Theory banner

Smaller universal poset

Creative Commons 'BY' version 4.0 license
Abstract

We show that there is a constant \(C›0\) such that for each integer \(n\geq 1\), there is a poset on at most \(2^{2n/3+C\sqrt{n}}\) elements that contains each \(n\)-element poset as an (induced) subposet.

Mathematics Subject Classifications: 06A07, 06A06

Keywords: Universal Structure, Poset