The dim-boundedness conjectures for planar posets
Statement
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 , denoted , is the least number of linear extensions whose intersection is . 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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.