Connectivity conjecture for the friendship graph of knots
Statement
Let be the graph whose vertices are knot types and whose edges represent friendship, meaning that each knot is represented by a simple closed curve on a minimal genus Seifert surface of the other. Friendship-graph connectivity conjecture. The subgraph of spanned by non-trivial knots is connected. This would mean that any two non-trivial knot types can be joined by a finite sequence of pairwise friends; the paper presents this as a structural question about the friendship graph.
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.