46 citations · 98 across the 16 of their papers we have counts for
1 paper · 2 filters
Christopher Schafhauser
Let E be a countable directed graph. We show that C∗(E) is AF-embeddable if and only if no loop in E has an entrance. The proof is constructive and is in the same spirit as…