2019/06/30 by Kozik, Jakub, Micek, Piotr, Trotter, William T.
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1907.00380
We show that height h posets that have planar cover graphs have dimension O(h6). Previously, the best upper bound was 2O(h3). Planarity plays a key role in our arguments, since there are posets such that (1) dimension is exponential in height and (2) the cover graph excludes K5 as a minor.