Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.24015 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911182282031104 |
|---|---|
| author | Mella, Lotrenzo Rinaldi, Gloria |
| author_facet | Mella, Lotrenzo Rinaldi, Gloria |
| contents | In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod $6$). For each odd $k > 3$ we also find lower bounds for the number of non isomorphic cyclic $k$-cycle systems of a complete graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_24015 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph Mella, Lotrenzo Rinaldi, Gloria Combinatorics In a recent paper (2024) M. Buratti and M.E:Muzychuck have established some lower bounds on the number of non isomorphic cyclic Steiner Triple Systems of order $v\equiv 1$ (mod $6$). We complete their result to the case $v\equiv 3$ (mod $6$). For each odd $k > 3$ we also find lower bounds for the number of non isomorphic cyclic $k$-cycle systems of a complete graph. |
| title | Some bounds on the number of non isomorphic cyclic k-cycle systems of the complete graph |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2509.24015 |