ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let YGY_G denote its strict realization space, and let Rℓ\mathcal{R}_\ell denote the relevant matroid or independence structure. A graph is K2,3′K_{2,3}^{'}-free if it contains no subgraph isomorphic to K2,3′K_{2,3}^{'}.

Strict realizability conjecture. If GG is a K2,3′K_{2,3}^{'}-free graph which is independent in Rℓ\mathcal{R}_\ell, then

YG≠∅.Y_G \neq \emptyset.

This gives a sufficient condition for strict realizability. The source presents it as a conjecture following examples of graphs that are not strictly realizable.

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.