A new proof of Delahan's induced-universality result
Abstract
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 n(n-1)2+1 vertices. This new proof is obtained by considering the notion of generating index sets for Steinhaus triangles.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.