A new proof of Delahan's induced-universality result
Discrete Mathematics
2026-03-10 v1 Combinatorics
Abstract
We give a short and self-contained proof of Delahan's theorem stating that every simple graph on vertices occurs as an induced subgraph of a Steinhaus graph on vertices. This new proof is obtained by considering the notion of generating index sets for Steinhaus triangles.
Cite
@article{arxiv.2603.08106,
title = {A new proof of Delahan's induced-universality result},
author = {Jonathan Chappelon},
journal= {arXiv preprint arXiv:2603.08106},
year = {2026}
}
Comments
12 pages