14.1DMMar 9
A new proof of Delahan's induced-universality resultJonathan Chappelon
We give a short and self-contained proof of Delahan's theorem stating that every simple graph on $n$ vertices occurs as an induced subgraph of a Steinhaus graph on $\frac{n(n-1)}{2}+1$ vertices. This new proof is obtained by considering the notion of generating index sets for Steinhaus triangles.