Whiteley's conjecture equating the 3-dimensional rigidity and cofactor matroids
Whiteley's conjecture equating the 3-dimensional rigidity and cofactor matroids
For each integer , let denote the 3-dimensional rigidity matroid of the complete graph and let denote the corresponding cofactor matroid.
Whiteley's conjecture. These matroids are equal for every :
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.