Bill Jackson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Bill Jackson has a total of 76 co-authors. Here are the top co-authors by number of shared publications:
- Anthony Nixon
School of Mathematical Sciences Lancaster University Lancaster UK
12 shared publications - Tibor Jordán
Eotvos University, and the MTA-ELTE Egervary Research Group on Combinatorial optimization
7 shared publications - Hakan Guler
Department of Mathematics Faculty of Arts & Sciences Kastamonu University Kastamonu Turkey
6 shared publications - Shin-Ichi Tanigawa
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Tokyo, Japan
6 shared publications - J. C. Owen
Park House CB3 0DU Siemens Cambridge England
4 shared publications - Alan D. Sokal
Department of Mathematics University College London WC1E 6BT London UK
3 shared publications
Latest Publications
- Open Access
- 8 June 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (3) , 23
Volume Rigidity of Simplicial Manifolds
Classical results of Cauchy [4] and Dehn [5] imply that the 1-skeleton of a convex simplicial polyhedron P is rigid, i.e. every continuous motion of the vertices of P in $${\mathbb R}^3$$ which preserves its edge lengths results in a polyhedron which is congruent to P . This result was extended to convex simplicial polytopes in $${\mathbb R}^d$$ for all $$d\ge 3$$ by Whiteley [16], and to generic realisations of 1-skeletons of simplicial $$(d-1)$$ -manifolds in $${\mathbb R}^{d}$$ by Kalai [8] for $$d\ge 4$$ and Fogelsanger [6] for $$d\ge 3$$ . We will generalise Kalai’s result by showing that, for all $$d\ge 4$$ and any fixed $$1\le k\le d-3$$ , every generic realisation of the k -skeleton of a simplicial $$(d-1)$$ -manifold in $${\mathbb R}^{d}$$ is volume rigid, i.e. every continuous motion of its vertices in $${\mathbb R}^d$$ which preserves the volumes of its k -faces results in a congruent realisation. In addition, we conjecture that our result remains true for $$k=d-2$$ and verify this conjecture when $$d=4,5,6$$ .- 8 June 2026
- Published by Springer Nature in Combinatorica
- Vol. 46 (3) , 23
Open AccessVolume Rigidity of Simplicial Manifolds
Classical results of Cauchy [4] and Dehn [5] imply that the 1-skeleton of a convex simplicial polyhedron P is rigid, i.e. every continuous motion of the vertices of P in $${\mathbb R}^3$$ which preserves its edge lengths results in a polyhedron which is congruent to P . This result was extended to convex simplicial polytopes in $${\mathbb R}^d$$ for all $$d\ge 3$$ by Whiteley [16], and to generic realisations of 1-skeletons of simplicial $$(d-1)$$ -manifolds in $${\mathbb R}^{d}$$ by Kalai [8] for $$d\ge 4$$ and Fogelsanger [6] for $$d\ge 3$$ . We will generalise Kalai’s result by showing that, for all $$d\ge 4$$ and any fixed $$1\le k\le d-3$$ , every generic realisation of the k -skeleton of a simplicial $$(d-1)$$ -manifold in $${\mathbb R}^{d}$$ is volume rigid, i.e. every continuous motion of its vertices in $${\mathbb R}^d$$ which preserves the volumes of its k -faces results in a congruent realisation. In addition, we conjecture that our result remains true for $$k=d-2$$ and verify this conjecture when $$d=4,5,6$$ . - Open Access
Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies the sparsity condition $|E(H)|\leq d|V(H)|-\binom{d+1}{2}$ for all subgraphs $H$ with at least $d+1$ vertices. Several other families of graphs $G$ arising naturally in rigidity theory, such as minimally globally $d$-rigid graphs, are known to satisfy the bound $|E(G)|\leq (d+1)|V(G)|-\binom{d+2}{2}$. We unify and extend these results by considering the family of $d$-stress-independent graphs which includes many of these families. We show that every $d$-stress-independent graph is $\mathcal{R}_{d+1}$-independent. A key ingredient in our proofs is the concept of $d$-stress-linked pairs of vertices. We derive a new sufficient condition for $d$-stress linkedness and use it to obtain a similar condition for a pair of vertices of a graph to be globally $d$-linked. This result strengthens a result of Tanigawa on globally $d$-rigid graphs. We also show that every minimally $\mathcal{R}_d$-connected graph $G$ is $\mathcal{R}_{d+1}$-independent and that the only subgraphs of $G$ that can satisfy Maxwell's criterion for $\mathcal{R}_{d+1}$-independence with equality are copies of $K_{d+2}$. Our results give affirmative answers to two conjectures in graph rigidity theory.Open AccessSparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies the sparsity condition $|E(H)|\leq d|V(H)|-\binom{d+1}{2}$ for all subgraphs $H$ with at least $d+1$ vertices. Several other families of graphs $G$ arising naturally in rigidity theory, such as minimally globally $d$-rigid graphs, are known to satisfy the bound $|E(G)|\leq (d+1)|V(G)|-\binom{d+2}{2}$. We unify and extend these results by considering the family of $d$-stress-independent graphs which includes many of these families. We show that every $d$-stress-independent graph is $\mathcal{R}_{d+1}$-independent. A key ingredient in our proofs is the concept of $d$-stress-linked pairs of vertices. We derive a new sufficient condition for $d$-stress linkedness and use it to obtain a similar condition for a pair of vertices of a graph to be globally $d$-linked. This result strengthens a result of Tanigawa on globally $d$-rigid graphs. We also show that every minimally $\mathcal{R}_d$-connected graph $G$ is $\mathcal{R}_{d+1}$-independent and that the only subgraphs of $G$ that can satisfy Maxwell's criterion for $\mathcal{R}_{d+1}$-independence with equality are copies of $K_{d+2}$. Our results give affirmative answers to two conjectures in graph rigidity theory. - Open Access
Volume Rigidity of Simplicial Manifolds
Classical results of Cauchy and Dehn imply that the 1-skeleton of a convex polyhedron $P$ is rigid i.e. every continuous motion of the vertices of $P$ in $\mathbb R^3$ which preserves its edge lengths results in a polyhedron which is congruent to $P$. This result was extended to convex poytopes in $\mathbb R^d$ for all $d\geq 3$ by Whiteley, and to generic realisations of 1-skeletons of simplicial $(d-1)$-manifolds in $\mathbb R^{d}$ by Kalai for $d\geq 4$ and Fogelsanger for $d\geq 3$. We will generalise Kalai's result by showing that, for all $d\geq 4$ and any fixed $1\leq k\leq d-3$, every generic realisation of the $k$-skeleton of a simplicial $(d-1)$-manifold in $\mathbb R^{d}$ is volume rigid, i.e. every continuous motion of its vertices in $\mathbb R^d$ which preserves the volumes of its $k$-faces results in a congruent realisation. In addition, we conjecture that our result remains true for $k=d-2$ and verify this conjecture when $d=4,5,6$.Open AccessVolume Rigidity of Simplicial Manifolds
Classical results of Cauchy and Dehn imply that the 1-skeleton of a convex polyhedron $P$ is rigid i.e. every continuous motion of the vertices of $P$ in $\mathbb R^3$ which preserves its edge lengths results in a polyhedron which is congruent to $P$. This result was extended to convex poytopes in $\mathbb R^d$ for all $d\geq 3$ by Whiteley, and to generic realisations of 1-skeletons of simplicial $(d-1)$-manifolds in $\mathbb R^{d}$ by Kalai for $d\geq 4$ and Fogelsanger for $d\geq 3$. We will generalise Kalai's result by showing that, for all $d\geq 4$ and any fixed $1\leq k\leq d-3$, every generic realisation of the $k$-skeleton of a simplicial $(d-1)$-manifold in $\mathbb R^{d}$ is volume rigid, i.e. every continuous motion of its vertices in $\mathbb R^d$ which preserves the volumes of its $k$-faces results in a congruent realisation. In addition, we conjecture that our result remains true for $k=d-2$ and verify this conjecture when $d=4,5,6$. - 8 May 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (1) , 95-106
Spanning even trees of graphs
A tree is said to be even if all pairs of vertices of degree one in are joined by a path of even length. We conjecture that every ‐regular nonbipartite connected graph has a spanning even tree and verify this conjecture when has a 2‐factor. Well‐known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when is odd and has at least bridges. We investigate this case further and propose some related conjectures.
- 8 May 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (1) , 95-106
Spanning even trees of graphs
A tree is said to be even if all pairs of vertices of degree one in are joined by a path of even length. We conjecture that every ‐regular nonbipartite connected graph has a spanning even tree and verify this conjecture when has a 2‐factor. Well‐known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when is odd and has at least bridges. We investigate this case further and propose some related conjectures.
- Open Access
- 17 November 2023
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 20-46
Maximal matroids in weak order posets
- 17 November 2023
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 20-46
Open AccessMaximal matroids in weak order posets
- Open Access
- 24 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 257-260
Issue Information
- 24 August 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 257-260
Open AccessIssue Information
- Open Access
- 13 April 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 282-288
Edge proximity conditions for extendability in regular bipartite graphs
Let and be positive integers with , let be an ‐regular cyclically ‐edge‐connected bipartite graph and let be a matching of size in . Plummer showed that whenever , there is a perfect matching of containing . When , Aldred and Jackson, extended this result to the case when by showing there is a perfect matching in containing whenever the edges in are pairwise at least distance apart where In this paper, we relax the condition that and the distance restriction introduced by Aldred and Jackson to show that, for and an ‐regular cyclically ‐edge‐connected bipartite graph, for each matching in with and such that each pair of edges in is distance at least 3 apart, there is a perfect matching in containing .
- 13 April 2023
- Published by Wiley in Journal of Graph Theory
- Vol. 104 (2) , 282-288
Open AccessEdge proximity conditions for extendability in regular bipartite graphs
Let and be positive integers with , let be an ‐regular cyclically ‐edge‐connected bipartite graph and let be a matching of size in . Plummer showed that whenever , there is a perfect matching of containing . When , Aldred and Jackson, extended this result to the case when by showing there is a perfect matching in containing whenever the edges in are pairwise at least distance apart where In this paper, we relax the condition that and the distance restriction introduced by Aldred and Jackson to show that, for and an ‐regular cyclically ‐edge‐connected bipartite graph, for each matching in with and such that each pair of edges in is distance at least 3 apart, there is a perfect matching in containing .
- Open Access
Flexible circuits in the $d$-dimensional rigidity matroid
A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on the underlying graph $G$, and is determined by the rank of the edge set of $G$ in the generic $d$-dimensional rigidity matroid $\mathcal{R}_d$. Complete combinatorial descriptions of the rank function of this matroid are known when $d=1,2$, and imply that all circuits in $\mathcal{R}_d$ are generically rigid in $\mathbb{R}^d$ when $d=1,2$. Determining the rank function of $\mathcal{R}_d$ is a long standing open problem when $d\geq 3$, and the existence of non-rigid circuits in $\mathcal{R}_d$ for $d\geq 3$ is a major contributing factor to why this problem is so difficult. We begin a study of non-rigid circuits by characterising the non-rigid circuits in $\mathcal{R}_d$ which have at most $d+6$ vertices.Open AccessFlexible circuits in the $d$-dimensional rigidity matroid
A bar-joint framework $(G,p)$ in $\mathbb{R}^d$ is rigid if the only edge-length preserving continuous motions of the vertices arise from isometries of $\mathbb{R}^d$. It is known that, when $(G,p)$ is generic, its rigidity depends only on the underlying graph $G$, and is determined by the rank of the edge set of $G$ in the generic $d$-dimensional rigidity matroid $\mathcal{R}_d$. Complete combinatorial descriptions of the rank function of this matroid are known when $d=1,2$, and imply that all circuits in $\mathcal{R}_d$ are generically rigid in $\mathbb{R}^d$ when $d=1,2$. Determining the rank function of $\mathcal{R}_d$ is a long standing open problem when $d\geq 3$, and the existence of non-rigid circuits in $\mathcal{R}_d$ for $d\geq 3$ is a major contributing factor to why this problem is so difficult. We begin a study of non-rigid circuits by characterising the non-rigid circuits in $\mathcal{R}_d$ which have at most $d+6$ vertices. - 19 November 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 69 (1) , 192-208
Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations
- 19 November 2022
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 69 (1) , 192-208
Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations
- Open Access
- 30 July 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (4) , 1-24
Coincident Rigidity of 2-Dimensional Frameworks
- 30 July 2022
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 38 (4) , 1-24
Open AccessCoincident Rigidity of 2-Dimensional Frameworks