Minimal 3-regular Penny Graph
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911463913816064 |
|---|---|
| author | Karabegov, Alexander Khovanova, Tanya |
| author_facet | Karabegov, Alexander Khovanova, Tanya |
| contents | We prove that a 3-regular penny graph has at least 16 vertices and show that such a graph with 16 vertices exists. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_01287 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Minimal 3-regular Penny Graph Karabegov, Alexander Khovanova, Tanya Combinatorics 05c10, 00A08 We prove that a 3-regular penny graph has at least 16 vertices and show that such a graph with 16 vertices exists. |
| title | Minimal 3-regular Penny Graph |
| topic | Combinatorics 05c10, 00A08 |
| url | https://arxiv.org/abs/2602.01287 |