Smaller universal poset

Journal Article (2026)
Author(s)

Paul Bastide (University of Oxford)

Carla Groenland (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Rajko Nenadov (University of Canterbury)

Research Group
Discrete Mathematics and Optimization
DOI related publication
https://doi.org/10.5070/C6.69946 Final published version
More Info
expand_more
Publication Year
2026
Language
English
Research Group
Discrete Mathematics and Optimization
Journal title
Combinatorial Theory
Issue number
3
Volume number
6
Article number
17
Page Views
11
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We show that there is a constant C > 0 such that for each integer n ⩾ 1, there is a poset on at most (Formula presenetd) elements that contains each n-element poset as an (induced) subposet.