The stress-linked pair component conjecture
Let be a graph and let . An -component of is a component with respect to the -matroid structure used in the paper. A pair is -stress-linked in a graph when it satisfies the stress-linkage condition defined in the paper.
Stress-linked pair component conjecture. If is -stress-linked in , then there is some -component of such that is -stress-linked in .
The source states that an affirmative answer would imply another conjecture in the paper. The claim is attributed there to Conjecture 6.4 of the cited work.
References
Primary source
Dániel Garamvölgyi, Bill Jackson and Tibor Jordán, “Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory”, arXiv:2509.03150 (2025).
Additional references
2 papers in this index state this conjecture (2023–2025). The statement above is taken from the most recent of them; the others are arXiv:2308.16851.
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
No solutions have been posted yet.