After explaining the notion of scaling limit of random graphs and the construction of Aldous' continuum random tree and of the Brownian map, I will introduce a new family of random graphs and their limits we called random feuilletages, in a recent paper with J.F. Marckert. These graphs are obtained by identifying points on a random discrete sphere, using a specific random process. We propose with this construction a generalization of the Brownian map in dimensions higher than two.