The Seifert-cycle tree characterization of Gauss codes
Statement
Let be a word in which every letter occurs exactly twice, and let be the simple graph obtained from the Seifert-cycle multigraph by replacing multiple edges between two vertices with a single edge.
Seifert-cycle tree conjecture. The graph is a tree if and only if is the Gauss code of a closed curve in the plane.
This conjecture proposes a purely graph-theoretic characterization of planar Gauss codes. The preceding construction associates Seifert cycles and their adjacency graph to any two-copy word, while the stated equivalence asks whether the reduced graph detects exactly those words realizable as Gauss codes of closed plane curves; no resolution is given here.
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.