Papers › Dimension of unicycle posets
Dimension of unicycle posets
Antoine Abram, Adrien Segovia
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Motivated by the study of the dimension of random posets, it was conjectured by Bollob\'as and Brightwell in 1997 that if P is a finite poset whose cover graph contains at most one cycle then its order dimension is at most 3. In this paper we prove this conjecture by giving a constructive proof with explicit triplets of linear extensions realizing such posets.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections