The bipartite linkless-embeddability conjecture
Statement
Let be a bipartite linklessly embeddable graph, and let be a -admissible order. Write for the balanced shift of . Bipartite linkless-embeddability conjecture. If , then is not a subgraph of , and consequently
In particular, all bipartite linklessly embeddable graphs are -stress free; hence, if and each have size at least ,
This is motivated by the non-linkless embeddability of minus an edge. The source explicitly states that even the inequality is open.
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.