The tangled-cord extremal conjecture for Hamiltonian sets in simple assembly graphs
Statement
Let ) be a simple assembly graph with rigid vertices, each of degree , and let denote the th Fibonacci number. A Hamiltonian set of polygonal paths is a Hamiltonian set as defined for such assembly graphs. Tangled-cord extremal conjecture. The upper bound for the maximal number of Hamiltonian sets of polygonal paths is
This bound is achieved only by the tangled cord with rigid vertices of degree . Earlier work established the upper bound and showed that it is tight; the conjecture concerns the uniqueness of the extremal graph, and the present paper develops equivalent combinatorial conditions intended to prove 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.