Cliques in minimally globally rigid graphs
Combinatorics
2026-05-01 v1
Abstract
We show that every minimally generically globally rigid graph in which contains a subgraph isomorphic to is itself isomorphic to , confirming a conjecture by Garamv{\"o}lgyi, Jackson, and Jord{\'a}n. The proof is entirely generated by ChatGPT 5.5.
Keywords
Cite
@article{arxiv.2604.27989,
title = {Cliques in minimally globally rigid graphs},
author = {Julien Portier},
journal= {arXiv preprint arXiv:2604.27989},
year = {2026}
}