Abstract
Let be a countable directed graph. We show that is AF-embeddable if and only if no loop in has an entrance. The proof is constructive and is in the same spirit as the Drinen-Tomforde desingularization.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.