The conjecture that knot-generated graphs differ from graphs with polynomial one
Statement
Let be the set of graphs isotopic to planar graphs, the set of graphs isotopic to graphs obtained from planar graphs by the specified moves, the set of graphs isotopic to graphs obtained from knots, including the unknot, by those moves, and the set of graphs whose polynomial equals . The known inclusions are .
The conjecture that and differ.
This asserts that not every graph with polynomial can be obtained from a knot by the specified moves. The paper presents the question alongside the established inclusions but gives no proof or resolution of this separation.
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.