Posets with cover graph of pathwidth two have bounded dimension

From MaRDI portal




Abstract: Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant d such that if P is a poset with cover graph of P of pathwidth at most 2, then dim(P)leqd. We answer this question in the affirmative by showing that d=17 is sufficient. We also show that if P is a poset containing the standard example S5 as a subposet, then the cover graph of P has treewidth at least 3.









This page was built for publication: Posets with cover graph of pathwidth two have bounded dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304175)