The convex-extension conjecture for COM tope graphs
Statement
Let and denote the classes of tope graphs of complexes of oriented matroids and oriented matroids, respectively. A graph is a convex subgraph of a graph if is an induced subgraph containing every shortest path in between vertices of .
Convex-extension conjecture. Every is a convex subgraph of a graph .
This restates a conjecture from the cited literature in terms of tope graphs. It asks whether every COM tope graph can be embedded convexly into an oriented-matroid tope graph; the supplied text does not indicate that the conjecture has been resolved.
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.