Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.02124 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914963397804032 |
|---|---|
| author | Sun, Timothy |
| author_facet | Sun, Timothy |
| contents | We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that the dual is simple and that the genera of the resulting embeddings match a lower bound of Brinkmann, Noguchi, and Van den Camp, showing that their lower bound is tight infinitely often. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_02124 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An optimal construction for complete graph embeddings with duals of low connectivity Sun, Timothy Combinatorics We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that the dual is simple and that the genera of the resulting embeddings match a lower bound of Brinkmann, Noguchi, and Van den Camp, showing that their lower bound is tight infinitely often. |
| title | An optimal construction for complete graph embeddings with duals of low connectivity |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2410.02124 |