We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikovs property C, and Dranishnikov and Zarichnyis straight finite decomposition complexity are preserved by constructions such as unions, free products, and group extensions.
Download