ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G1G_1 and G2G_2 be complete digraphs on pp nodes, with all edge directions agreeing except for the edge between nodes p−1p-1 and pp. 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 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.