Posets with cover graph of pathwidth two have bounded dimension

From MaRDI portal
Publication:304175

DOI10.1007/S11083-015-9359-7zbMATH Open1364.06002arXiv1308.4877OpenAlexW3098298570MaRDI QIDQ304175FDOQ304175


Authors: Csaba Biró, Mitchel T. Keller, Stephen J. Young Edit this on Wikidata


Publication date: 24 August 2016

Published in: Order (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1308.4877




Recommendations




Cites Work


Cited In (14)





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)