2 citations · 2 across the 1 of their papers we have counts for
1 paper
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…