ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be a positive integer. A graph is d(d+1)d(d+1)-connected when deleting fewer than d(d+1)d(d+1) vertices leaves it connected. The Lovász–Yemini conjecture. If a graph is d(d+1)d(d+1)-connected, then it is rigid in Rd\mathbb{R}^d. This conjecture would extend connectivity criteria for finding rigid, and potentially globally rigid, subgraphs in dimensions d≥3d\geq 3. The source says that it has remained open for over forty years.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

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.

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.