The constraining conjecture for minimal three-edge-connected simple graphs
Statement
Let be a minimal three edge connected simple graph. A twisted graph has the form , where is a directed graph on , is a total order, and 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 , there is a directed graph , a total order , and a constraining twisted graph .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.