Linked and non-linked embeddings of the graph of a convex 4-polytope
Statement
An embedded graph in is called linked if it contains two disjoint linked cycles. Is there a convex -polytope such that its -skeleton is linked as a graph in , but has a different embedding that is not linked?
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.