The bridge-free matroid criterion for isomorphism of graph algebras
Statement
Let and be graphs, and let their bridge-free matroids be the graphical matroids of their respective -subgraphs.
Bridge-free matroid criterion. The algebras and are isomorphic if and only if their bridge-free matroids are isomorphic.
The source presents this as a comparison, but the supplied text gives no resolution status beyond the assertion itself.
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.