Ben Clark

activity

20112019

most citedExcluded minors are almost fragile

6 citations · 7 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2019★ 1 cited

On the Highly Connected Dyadic, Near-Regular, and Sixth-Root-of-Unity Matroids

Ben Clark, Kevin Grace, James Oxley +1

Subject to announced results by Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unit…

math.CO2017

Relaxations of GF $(4)$ -representable matroids

Ben Clark, James Oxley, Stefan H. M. van Zwam

We consider the GF $(4)$ -representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF $(4)$ -representable. We charact…

math.CO2016

Displaying tangles and non-sequential separations

Ben Clark

We show that, for any graph or matroid, there is a tree that simultaneously distinguishes its maximal tangles, and, for each maximal tangle $T$ that satisfies an addition…

math.CO2016★ 6 cited

Excluded minors are almost fragile

Nick Brettell, Ben Clark, James Oxley +2

Let $M$ be an excluded minor for the class of $P$ -representable matroids for some partial field $P$ , and let $N$ be a $3$ -connected strong $P$ -stabilizer…

math.CO2015

The structure of ${U_{2, 5}, U_{3, 5}}$ -fragile matroids

Ben Clark, Dillon Mayhew, Stefan van Zwam +1

Let $N$ be a set of matroids. A matroid $M$ is strictly $N$ -fragile if $M$ has a member of $N$ as minor and, for all $e \in E (M)$ , at least one of $M\…

math.CO2011

Tangles, trees, and flowers

Ben Clark, Geoff Whittle

A tangle of order $k$ in a matroid or graph may be thought of as a " $k$ -connected component". For a tangle of order $k$ in a matroid or graph that satisfies a certain robustness co…