2018/02/27 by D'Angeli, Daniele, Donno, Alfredo · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1802.09839
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted limit graph. We show that there are uncountably many classes of isomorphism of such limit graphs, regarded as unrooted graphs.