Statement

After Edoardo accidentally found Giorgio working on fractals (amazing mathematical shapes with recursive definitions), he decided to do something similar… but in a somewhat more computer science fashion. After days of excruciating research, he finally discovered the fractal graphs G_N! The first member of this family of graphs, is a mathematical object consisting of a set V of nodes (unlabelled points) and a set E of edges (undirected links between couple of points), so that E ⊆ V × V. G_0, is very simple: a single node without any edges. After that, the graphs quickly grow in complexity as N increases. More precisely, each fractal graph G_N for N>0 is obtained from its predecessor G_N-1 by adding: (1) A triangle T for every node v in G_N-1, so that one of the nodes of T is v and the other nodes and edges are new...