1 problem

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 seede…