activity
20072026
most citedThe internally 4-connected binary matroids with no M(K3,3)-minor

10 citations · 40 across the 33 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

math.CO2010

The structure of graphs with a vital linkage of order 2

Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam

A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pair…

math.CO2010★ 1 cited

Stability, fragility, and Rota's Conjecture

Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable mat…