Finiteness conjecture for irreducible polyhedral graphs with fixed rigid vertices
Statement
Let be the set of all irreducible polyhedral graphs with rigid vertices. Finiteness conjecture. Each set 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.