GWGeoff Whittle

Geoff Whittle

*This is an algorithmically generated author record based on publicly available information.

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


Geoff Whittle has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The excluded minors for 2- and 3-regular matroids

    by Nick Brettell, James Oxley, Charles Semple, Geoff Whittle

    The class of 2-regular matroids is a natural generalisation of regular and near-regular matroids. We prove an excluded-minor characterisation for the class of 2-regular matroids. The class of 3-regular matroids coincides with the class of matroids representable over the Hydra-5 partial field, and the 3-connected matroids in the class with a $U_{2,5}$- or $U_{3,5}$-minor are precisely those with six inequivalent representations over GF(5). We also prove that an excluded minor for this class has at most 15 elements.

  • Open Access

    Excluded minors are almost fragile II: essential elements

    by Nick Brettell, James Oxley, Charles Semple, Geoff Whittle

    Let $M$ be an excluded minor for the class of $\mathbb{P}$-representable matroids for some partial field $\mathbb{P}$, let $N$ be a $3$-connected strong $\mathbb{P}$-stabilizer that is non-binary, and suppose $M$ has a pair of elements $\{a,b\}$ such that $M\backslash a,b$ is $3$-connected with an $N$-minor. Suppose also that $|E(M)| \geq |E(N)|+11$ and $M \backslash a,b$ is not $N$-fragile. In the prequel to this paper, we proved that $M \backslash a,b$ is at most five elements away from an $N$-fragile minor. An element $e$ in a matroid $M'$ is $N$-essential if neither $M'/e$ nor $M' \backslash e$ has an $N$-minor. In this paper, we prove that, under mild assumptions, $M \backslash a,b$ is one element away from a minor having at least $r(M)-2$ elements that are $N$-essential.

  • Open Access

    $N$-detachable pairs in 3-connected matroids III: the theorem

    by Nick Brettell, Geoff Whittle, Alan Williams

    Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an $N$-minor. This is the third and final paper in a series where we prove that if $|E(M)|-|E(N)| \ge 10$, then either $M$ has an $N$-detachable pair after possibly performing a single $\Delta$-$Y$ or $Y$-$\Delta$ exchange, or $M$ is essentially $N$ with a spike attached. Moreover, we describe the additional structures that arise if we require only that $|E(M)|-|E(N)| \ge 5$.

  • Open Access

    $N$-detachable pairs in 3-connected matroids II: life in $X$

    by Nick Brettell, Geoff Whittle, Alan Williams

    Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an $N$-minor. This is the second in a series of three papers where we describe the structures that arise when it is not possible to find an $N$-detachable pair in $M$. In the first paper in the series, we showed that, under mild assumptions, either $M$ has an $N$-detachable pair, $M$ has one of three particular 3-separators that can appear in a matroid with no N-detachable pairs, or there is a 3-separating set $X$ with certain strong structural properties. In this paper, we analyse matroids with such a structured set $X$, and prove that they have either an $N$-detachable pair, or one of five particular 3-separators that can appear in a matroid with no $N$-detachable pairs.

  • Open Access

    Certifying non-representability of matroids over prime fields

    by J Geelen, Geoffrey Whittle

    © 2015 Elsevier Inc. It is proved that, for a prime number p, showing that an n-element matroid is not representable over GF(p) requires only O(n2) rank evaluations.

  • Open Access

    Certifying non-representability of matroids over prime fields

    by J Geelen, Geoffrey Whittle

    © 2015 Elsevier Inc. It is proved that, for a prime number p, showing that an n-element matroid is not representable over GF(p) requires only O(n2) rank evaluations.

  • Open Access

    N-detachable pairs in 3-connected matroids I: Unveiling X

    by N Brettell, G Whittle, A Williams

    © 2019 Elsevier Inc. Let M be a 3-connected matroid, and let N be a 3-connected minor of M. We say that a pair {x1,x2}⊆E(M) is N-detachable if one of the matroids M/x1/x2 or M\x1\x2 is both 3-connected and has an N-minor. This is the first in a series of three papers where we describe the structures that arise when M has no N-detachable pairs. In this paper, we prove that if no N-detachable pair can be found in M, then either M has a 3-separating set, which we call X, with certain strong structural properties, or M has one of three particular 3-separators that can appear in a matroid with no N-detachable pairs.

  • Open Access

    N-detachable pairs in 3-connected matroids I: Unveiling X

    by N Brettell, G Whittle, A Williams

    © 2019 Elsevier Inc. Let M be a 3-connected matroid, and let N be a 3-connected minor of M. We say that a pair {x1,x2}⊆E(M) is N-detachable if one of the matroids M/x1/x2 or M\x1\x2 is both 3-connected and has an N-minor. This is the first in a series of three papers where we describe the structures that arise when M has no N-detachable pairs. In this paper, we prove that if no N-detachable pair can be found in M, then either M has a 3-separating set, which we call X, with certain strong structural properties, or M has one of three particular 3-separators that can appear in a matroid with no N-detachable pairs.

  • Open Access

    $N$-detachable pairs in 3-connected matroids I: unveiling $X$

    by Nick Brettell, Geoff Whittle, Alan Williams

    Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. We say that a pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an $N$-minor. This is the first in a series of three papers where we describe the structures that arise when it is not possible to find an $N$-detachable pair in $M$. In this paper, we prove that if $M$ has no $N$-detachable pairs, then either $M$ has a 3-separating set, which we call $X$, with certain strong structural properties, or $M$ has one of three particular 3-separators that can appear in a matroid with no $N$-detachable pairs.

  • Open Access

    On Density-Critical Matroids

    by Rutger Campbell, Kevin Grace, James Oxley, Geoff Whittle

    For a matroid $M$ having $m$ rank-one flats, the density $d(M)$ is $\tfrac{m}{r(M)}$ unless $m = 0$, in which case $d(M)= 0$. A matroid is density-critical if all of its proper minors of non-zero rank have lower density. By a 1965 theorem of Edmonds, a matroid that is minor-minimal among simple matroids that cannot be covered by $k$ independent sets is density-critical. It is straightforward to show that $U_{1,k+1}$ is the only minor-minimal loopless matroid with no covering by $k$ independent sets. We prove that there are exactly ten minor-minimal simple obstructions to a matroid being able to be covered by two independent sets. These ten matroids are precisely the density-critical matroids $M$ such that $d(M) > 2$ but $d(N) \le 2$ for all proper minors $N$ of $M$. All density-critical matroids of density less than $2$ are series-parallel networks. For $k \ge 2$, although finding all density-critical matroids of density at most $k$ does not seem straightforward, we do solve this problem for $k=\tfrac{9}{4}$.