The unlabelled Diestel–Leader graph seeded tiling conjecture

For integers $p,q\geq 2$, let ${\mathsf{DL}(p,q)}$ be the Diestel–Leader graph, and let the unlabelled graph mean this graph considered without its standard edge labelling. A seeded tiling problem asks whether a finite tileset admits a tiling subject to a prescribed seed condition. Unlabelled Diestel–Leader graph conjecture. The unlabelled graph ${\mathsf{DL}(p,q)}$ has undecidable seeded tiling problem. The corresponding labelled Diestel–Leader graphs have undecidable seeded tiling problem, whereas the unlabelled case is posed as a better question and remains unresolved.