The asymptotic-dimension conjecture for bounded sphere dimension

Let d1d\geq 1 be an integer, and consider the class of graphs whose sphere dimension is at most dd. Asymptotic-dimension conjecture. This class has asymptotic dimension at most dd.

The bound would be tight because the hypercubic lattice Zd\mathbb{Z}^d has both asymptotic dimension and sphere dimension equal to dd. The conjecture is known for d=1d=1 and d=2d=2, and an improved general upper bound of d+1d+1 is known; the asserted bound dd remains open for general dd.

Sources & referencesView supporting material

Primary source

James Davies, Agelos Georgakopoulos, Meike Hatzel and Rose McCarty, “Strongly sublinear separators and bounded asymptotic dimension for sphere intersection graphs”, arXiv:2504.00932 (2025).

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.