ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Pkirr{\mathcal{P}}_k^\text{irr} be the set of all irreducible polyhedral graphs with kk rigid vertices. Finiteness conjecture. Each set Pkirr{\mathcal{P}}_k^\text{irr} is finite. This conjecture asserts that, unlike reducible polyhedra, irreducible polyhedral graphs cannot have an unbounded number of non-rigid vertices while the number of rigid vertices remains fixed; the source indicates that this prediction is supported by further classifications but does not establish it.

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.