The design spectrum of the Shrikhande graph
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911089651875840 |
|---|---|
| author | Forbes, Anthony D. Rutherford, Carrie G. |
| author_facet | Forbes, Anthony D. Rutherford, Carrie G. |
| contents | The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. The purpose of this short paper is to prove that the Shrikhande graph and the line graph of $K_{4,4}$ have the design spectrum $\{96t + 1: t = 1, 2, \dots\}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00859 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The design spectrum of the Shrikhande graph Forbes, Anthony D. Rutherford, Carrie G. Combinatorics 05B25 The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)$ copies of $G$. The purpose of this short paper is to prove that the Shrikhande graph and the line graph of $K_{4,4}$ have the design spectrum $\{96t + 1: t = 1, 2, \dots\}$. |
| title | The design spectrum of the Shrikhande graph |
| topic | Combinatorics 05B25 |
| url | https://arxiv.org/abs/2505.00859 |