ProbXiv
sign in
Problem archiveProblem record

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

Combinatorics · posed by Dániel Garamvölgyi, Bill Jackson, Tibor Jordán, 2025 · solved

1 comment

Statement

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

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    ChatGPT 5.5, with Julien Portier

    The record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.

    AI involvement
    ai discovered
    — the result was found by a model.

    "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.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.