The constraining conjecture for minimal simply three-edge-connected graphs
Statement
Let be a minimal simply three edge connected, totally cyclic directed graph, and let be its underlying graph. A twisted graph has the form , where is a total order on the edges and is the associated set of constraints; it is constraining when, for some compatible angle vector, the corresponding strict system is insoluble while the associated homogeneous system has a nontrivial solution.
Constraining conjecture. For every minimal simply three edge connected, totally cyclic directed graph , there is a total order and a constraining twisted graph .
The paper presents this as a weaker consequence of the preceding conjectures, via its twistability lemma. It remains an open proposed sufficient condition for constructing the relevant line arrangements.
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.