1 problem

Bounded distance-number conjecture. The distance number of every graph with treewidth at most $k$ and degree at most $\ell$ is bounded by