ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a simple assembly graph with nn rigid vertices, each of degree 44, and let FkF_k denote the kkth 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

F2n+1−1.F_{2n+1}-1.

This bound is achieved only by the tangled cord with nn rigid vertices of degree 44. 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 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.