On the Queue-Number of Partial Orders
Combinatorics
2021-08-24 v1 Discrete Mathematics
Abstract
The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width has queue-number at most . Recently, Alam et al. constructed posets of width with queue-number . Our contribution is a construction of posets with width with queue-number . This asymptotically matches the known upper bound.
Keywords
Cite
@article{arxiv.2108.09994,
title = {On the Queue-Number of Partial Orders},
author = {Stefan Felsner and Torsten Ueckerdt and Kaja Wille},
journal= {arXiv preprint arXiv:2108.09994},
year = {2021}
}
Comments
Appears in the Proceedings of the 29th International Symposium on Graph Drawing and Network Visualization (GD 2021)