Cover-graph incidence-poset doubling conjecture

Let PP be a poset, let GG be the cover graph of PP, and let QQ be the incidence poset of GG. Cover-graph incidence-poset doubling conjecture. For every t1t\ge1, there exists a poset PP such that

dim(Q)=2dim(P).\dim(Q)=2\dim(P).

The text notes that this holds when t2t\le2 but reports that the issue for larger values of tt remains unsettled.

Sources & referencesView supporting material

Primary source

William T. Trotter and Ruidong Wang, “Incidence Posets and Cover Graphs”, arXiv:1308.2471 (2013).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.