5 citations · 27 across the 19 of their papers we have counts for
1 paper · 2 filters
Jonathan 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…