100 citations · 123 across the 20 of their papers we have counts for
22 papers
Matroids Arising From Nested Sequences of Flats In Projective And Affine Geometries
Matthew Mizell, James Oxley
Targets are matroids that arise from a nested sequence of flats in a projective geometry. This class of matroids was introduced by Nelson and Nomoto, who found the forbidden induce…
A binary-matroid analogue of a graph connectivity result of Jamison and Mulder
Cameron Crenshaw, James Oxley
Let be a graph such that, whenever two vertices and of are joined by three internally disjoint paths, and are adjacent. Jamison and Mulder determined that t…
Chordal matroids arising from generalized parallel connections
James Dylan Douthitt, James Oxley
A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeate…
The excluded minors for 2- and 3-regular matroids
Nick Brettell, James Oxley, Charles Semple +1
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. T…
Excluded minors are almost fragile II: essential elements
Nick Brettell, James Oxley, Charles Semple +1
Let be an excluded minor for the class of -representable matroids for some partial field , let be a -connected strong -stabilizer tha…
Ordering Circuits of Matroids
Cameron Crenshaw, James Oxley
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adja…