A math problem that has stumped researchers was just solved entirely by a single AI agent.
Mathematical conjectures usually require years of human intuition and formal verification. This work presents a complete proof for a specific property of minimally globally rigid graphs generated by ChatGPT 5.5. It is one of the first times an LLM has crossed the bridge from assisting humans to performing independent discovery in pure mathematics. This result confirms that generative models are moving beyond language into the realm of formal symbolic reasoning. It marks a shift where AI is now a legitimate collaborator in solving the world hardest theoretical puzzles. We no longer need to wait for a genius to solve these conjectures.
Cliques in minimally globally rigid graphs
arXiv · 2604.27989
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.