Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.08106 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911498808328192 |
|---|---|
| author | Chappelon, Jonathan |
| author_facet | Chappelon, Jonathan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_08106 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A new proof of Delahan's induced-universality result Chappelon, Jonathan Discrete Mathematics Combinatorics 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. |
| title | A new proof of Delahan's induced-universality result |
| topic | Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2603.08106 |