Garamvölgyi-Jackson-Jordán Conjecture on Cliques in Minimally Globally Rigid Graphs
Every minimally generically globally rigid graph in containing a subgraph isomorphic to is itself isomorphic to , confirming Conjecture 6.3 of Garamvölgyi, Jackson and Jordán (2025).
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Rigidity theory
- Posed by
- Dániel Garamvölgyi, Bill Jackson, Tibor Jordán
- Year posed
- 2025
- Years open
- 1y
- Solved
- 2026-04-30
- Model
- ChatGPT 5.5
- Vendor
- OpenAI
- Collaborators
- Julien Portier
- Verification
- Unreviewed
- Publication
- Preprint
- Significance
- 8 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
"The proof is entirely generated by ChatGPT 5.5." The author had an intuition about the natural stress-matrix strategy but deliberately withheld it from the prompt; the model independently identified the same strategy, resolved the algebraic difficulty the author was stuck on, and produced the proof, which the author checked and edited.