ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a minimal three edge connected simple graph. A twisted graph has the form T=(G⃗,G,<,A)T=(\vec{G},G,<,A), where G⃗\vec{G} is a directed graph on GG, << is a total order, and AA is the associated constraint set; it is constraining when the corresponding strict system is insoluble while the associated homogeneous system has a nontrivial solution.

Constraining conjecture. For every minimal three edge connected simple graph GG, there is a directed graph G⃗\vec{G}, a total order <<, and a constraining twisted graph T=(G⃗,G,<,A)T=(\vec{G},G,<,A).

This is stated as a still weaker consequence of the preceding conjectures. It would provide a graph-theoretic route to the required obstruction and line-arrangement constructions, but is unresolved in the source.

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.