Ionescu's theorem for higher-rank graphs S. KaliszewskiAdam MorganJohn Quigg 46L05higher-rank graph $C^*$-algebraMauldin-Williams graph We will define new constructions similar to the graph systems of correspondences described by Deaconu \emph{et al}. We will use these to prove a version of Ionescu's theorem for higher-rank graphs. Afterwards, we will examine the properties of these constructions further, and make contact with Yeend's topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims. Indiana University Mathematics Journal 2015 text pdf 10.1512/iumj.2015.64.5709 10.1512/iumj.2015.64.5709 en Indiana Univ. Math. J. 64 (2015) 1879 - 1901 state-of-the-art mathematics http://iumj.org/access/