The dim-boundedness conjectures for planar posets

From papers

A poset has a planar diagram if its cover graph can be drawn in the plane with every cover relation represented by a curve directed upwards. Its cover graph is the graph whose vertices are the elements of the poset and whose edges join pairs in a cover relation. The dimension of a poset PP, denoted dim(P)\dim(P), is the least number of linear extensions whose intersection is PP. A class of posets is dim-bounded if the dimensions of its members are bounded by a function of the relevant structural parameter—in particular, here by an absolute constant for the stated class. The planar-poset dim-boundedness conjectures. (1) The class of posets with planar diagrams is dim-bounded. (2) The class of posets with planar cover graphs is dim-bounded. These statements address whether planarity, despite allowing posets of arbitrarily large dimension in known constructions, forces dimension to remain bounded. The paper discusses the longstanding problem and notes that the planar cover-graph case is pursued through results forcing large standard examples; the supplied text does not establish either assertion.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Heather Smith Blake, Jędrzej Hodor, Piotr Micek, Michał T. Seweryn and William T. Trotter, “Planarity and dimension I”, arXiv:2510.18603 (2025).

Additional references

2 papers in this index state this conjecture (2022–2025). The statement above is taken from the most recent of them; the others are arXiv:2206.06942.

Solutions 0

No solutions have been posted yet.