Whiteley's conjecture equating the 3-dimensional rigidity and cofactor matroids

For each integer n2n\geq 2, let R3(Kn)\mathcal{R}_3(K_n) denote the 3-dimensional rigidity matroid of the complete graph and let C21(Kn)\mathcal{C}_2^1(K_n) denote the corresponding cofactor matroid.

Whiteley's conjecture. These matroids are equal for every n2n\geq 2:

R3(Kn)=C21(Kn).\mathcal{R}_3(K_n)=\mathcal{C}_2^1(K_n).

If true, this would transfer the known rank formula for the cofactor matroid to the 3-dimensional rigidity matroid and would imply Dress's conjecture. The source describes it as a long-standing conjecture and gives no resolution.

Sources & referencesView supporting material

Primary source

Bill Jackson, Tibor Jordán and Soma Villányi, “Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs”, arXiv:2607.26266 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.