Predavatelj: Daniele D’Angeli (TU Graz, Avstrija)

In this talk I will define an increasing sequence of graphs inspired by the famous Sierpiński fractal. The vertices of such graphs are labeled by (finite) words over a finite alphabet. Passing to the limit (in the sense of Gromov-Hausdorff) one gets infinitely many graphs, whose vertices are labeled by right infinite words. I will give a complete classification of them up to isomorphism, showing that there are infinitely many isomorphism classes, each containing either three or six graphs.