Complete-digraph edge-reversal conjecture for Jacobian matroids
Statement
Let and be complete digraphs on nodes, with all edge directions agreeing except for the edge between nodes and . Complete-digraph edge-reversal conjecture. The two graphs have the same Jacobian matroid. The conjecture concerns a limitation of Jacobian-matroid methods: even complete graphs differing only by this edge orientation may define the same matroid. The paper reports computational evidence for related coincidences but gives no proof or resolution of this claim.
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.