Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.24935 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912675583229952 |
|---|---|
| author | Huggan, Melissa A. Huntemann, Svenja Stevens, Brett |
| author_facet | Huggan, Melissa A. Huntemann, Svenja Stevens, Brett |
| contents | The game Nofil is a two-player combinatorial game in which players take turns marking points of a design such that the set of marked points does not contain a block. Equivalently, we can think of the points as being deleted from the design and points that are on singleton sets can no longer be marked. Every game play eventually results in the design becoming a graph. Previous work has shown that every graph is reachable from some Steiner triple system (STS), although the order of the constructed STS is often far from the known lower bounds. In this paper we give embeddings of complete graphs and star graphs into a $\STS$ that is minimal or very nearly meets the bounds. We further discuss possible minimal embeddings of empty graphs, paths, and cycles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24935 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Minimal Graph Embeddings via Point Deletions in Steiner triple systems Huggan, Melissa A. Huntemann, Svenja Stevens, Brett Combinatorics The game Nofil is a two-player combinatorial game in which players take turns marking points of a design such that the set of marked points does not contain a block. Equivalently, we can think of the points as being deleted from the design and points that are on singleton sets can no longer be marked. Every game play eventually results in the design becoming a graph. Previous work has shown that every graph is reachable from some Steiner triple system (STS), although the order of the constructed STS is often far from the known lower bounds. In this paper we give embeddings of complete graphs and star graphs into a $\STS$ that is minimal or very nearly meets the bounds. We further discuss possible minimal embeddings of empty graphs, paths, and cycles. |
| title | Minimal Graph Embeddings via Point Deletions in Steiner triple systems |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2510.24935 |