The Queue-Number of Posets of Bounded Width or Height

Abstract : Heath and Pemmaraju conjectured that the queue-number of a poset is bounded by its width and if the poset is planar then also by its height. We show that there are planar posets whose queue-number is larger than their height, refuting the second conjecture. On the other hand, we show that any poset of width $2$ has queue-number at most $2$, thus confirming the first conjecture in the first non-trivial case. Moreover, we improve the previously best known bounds and show that planar posets of width $w$ have queue-number at most $3w-2$ while any planar poset with $0$ and $1$ has queue-number at most its width.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas
Contributor : Kolja Knauer <>
Submitted on : Friday, March 15, 2019 - 10:17:35 AM
Last modification on : Saturday, August 24, 2019 - 1:07:29 AM

Links full text


  • HAL Id : hal-02068620, version 1
  • ARXIV : 1806.04489



Kolja Knauer, Piotr Micek, Torsten Ueckerdt. The Queue-Number of Posets of Bounded Width or Height. 2019. ⟨hal-02068620⟩



Record views