ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (G,c)(G,c) be a colored graph, let Tc,j(G)T_{c,j}(G) denote the family of transversal edge sets associated with color jj, and let HH be a minimally rigid graph. Transversal characterization conjecture. The graph (G,c)(G,c) is minimally angle-rigid if and only if, for each color jj, there exists a transversal edge set X∈Tc,j(G)X \in T_{c,j}(G) and a minimally rigid graph HH such that

G=H∪X,X∩E(H)=∅.G=H\cup X,\qquad X\cap E(H)=\emptyset.

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 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.