Cliques in minimally globally rigid graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913077371338752 |
|---|---|
| author | Portier, Julien |
| author_facet | Portier, Julien |
| contents | We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{ö}lgyi, Jackson, and Jord{á}n. The proof is entirely generated by ChatGPT 5.5. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_27989 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Cliques in minimally globally rigid graphs Portier, Julien Combinatorics We show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{ö}lgyi, Jackson, and Jord{á}n. The proof is entirely generated by ChatGPT 5.5. |
| title | Cliques in minimally globally rigid graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2604.27989 |