Ionescu's theorem for higher rank graphs

S. Kaliszewski, Adam Morgan, John Quigg

We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher ra…