Source authenticated

Garamvölgyi-Jackson-Jordán Conjecture on Cliques in Minimally Globally Rigid Graphs

Every minimally generically globally rigid graph in $\mathbb{R}^d$ containing a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming Conjecture 6.3 of Garamvölgyi, Jackson and Jordán (2025).

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Apr 30, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.

Canonical aliases: Garamvölgyi-Jackson-Jordán Conjecture on Cliques in Minimally Globally Rigid Graphs · Cliques in rigid graphs

Confidence: Not scored

Registry verification: unreviewed · preprint · resolved

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Julien Portier
human · human collaborator

ChatGPT 5.5
model · ai model contributor · OpenAI

Lineage and corrections

This event attributed to Julien Portier

This event attributed to ChatGPT 5.5

Act on this frontier

Verify, challenge, or extend the result.

Help verify Open canonical problem