Transversal-matroid characterization of minimally angle-rigid colored graphs
Statement
Let be a colored graph, let denote the family of transversal edge sets associated with color , and let be a minimally rigid graph. Transversal characterization conjecture. The graph is minimally angle-rigid if and only if, for each color , there exists a transversal edge set and a minimally rigid graph such that
This conjecture is the formal version of the paper's proposed transversal-matroid description, motivated by experimental data and heuristic arguments. No resolution is supplied in the source, so the conjecture remains open.
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.