In 1989, Nešetřil and Pudlák posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most $10$. As a consequence, we are able to show that there is a reachability labeling scheme with labels consisting of $\mathcal{O}(\log n)$ bits for planar digraphs with a single source. The best known scheme for general planar digraphs uses labels with $\mathcal{O}(\log^2 n)$ bits [Thorup JACM 2004], and it remains open to determine whether a scheme using labels with $\mathcal{O}(\log n)$ bits exists. The Boolean dimension result is proved in tandem with a second result showing that the dimension of a poset with a planar cover graph and a unique minimal element is bounded by a linear function of its standard example number. However, one of the major challenges in dimension theory is to determine whether dimension is bounded in terms of standard example number for all posets with planar cover graphs.

翻译：暂无翻译