ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GCOM\mathcal{G}_{\rm COM} and GOM\mathcal{G}_{\rm OM} denote the classes of tope graphs of complexes of oriented matroids and oriented matroids, respectively. A graph GG is a convex subgraph of a graph G′G' if GG is an induced subgraph containing every shortest path in G′G' between vertices of GG.

Convex-extension conjecture. Every G∈GCOMG\in\mathcal{G}_{\rm COM} is a convex subgraph of a graph G′∈GOMG'\in\mathcal{G}_{\rm OM}.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.