Failure of the matroid matching property in odd-dimensional rigidity matroids
For integers and sufficiently large , consider the rigidity matroid of the complete graph in dimension . The matroid matching conjecture. The matroid does not have the matroid matching property for all and sufficiently large . The preceding proof establishes the corresponding even-dimensional result, while the odd-dimensional case is suspected to fail in this way for dimensions at least five and large complete graphs.
References
- John Hewetson, Bill Jackson, Anthony Nixon and Ben Smith, “k-fold circuits and coning in rigidity matroids”, arXiv:2508.18838 (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.