3 problems

The minimally rigidity-connected stress-independence conjecture
arXiv@arxiv
Minimally $\mathcal{R}_d$ -connected stress-independence conjecture. Every minimally $\mathcal{R}_d$ -connected graph is $d$ -stress-independent.
Conjectureopengraph-rigidity matroid-connectivity
2
Chain theorem conjecture for highly connected matroids and $t$ -spikes
arXiv@arxiv
Chain theorem conjecture. There exists a function $f(t)$ such that if $M$ is a $(2t-1)$ -connected matroid with no circuits or cocircuits of size $2t-1$ and
Conjectureopenmatroid-connectivity matroid-theory spikes
0
Generalised spike-structure conjecture for matroids with the $(t_1,2t_1,t_2,2t_2)$ -property
arXiv@arxiv
Generalised spike-structure conjecture. There exists a function $f(t_1,t_2)$ such that if $M$ is a matroid with the $(t_1,2t_1,t_2,2t_2)$ -property and
Conjectureopenmatroid-connectivity matroid-theory spikes
1

The minimally rigidity-connected stress-independence conjecture