The monotonicity conjecture for grid forbidden-subposet densities
The monotonicity conjecture for grid forbidden-subposet densities
Let be a poset of dimension at most , and let and denote the weak and strong grid density parameters. The grid-density monotonicity conjecture.
This asserts that both density parameters are monotone decreasing as the grid dimension increases. It is posed as an open problem in the paper.
Sources & referencesView supporting material
Primary source
Dániel Gerbner, Dániel T. Nagy, Balázs Patkós and Máté Vizer, “Forbidden subposet problems in the grid”, arXiv:2102.08297 (2021).
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
Sign in to submit a solution.
No solutions have been posted yet.