Kurz gefasst
Fachartikel in der Zeitschrift Combinatorial Theory, 2026. Verfasst von Paul Bastide und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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
Zitieren
APA
Bastide, P., Groenland, C., & Nenadov, R. (2026). Smaller universal poset. Combinatorial Theory. https://doi.org/10.5070/c6.69946
Vancouver
Bastide P, Groenland C, Nenadov R. Smaller universal poset. Combinatorial Theory. 2026. doi:10.5070/c6.69946
BibTeX
@article{Bastide2026,
author = {Bastide, Paul and Groenland, Carla and Nenadov, Rajko},
title = {Smaller universal poset},
journal = {Combinatorial Theory},
year = {2026},
doi = {10.5070/c6.69946}
}
EUVIMED