12 citations · 78 across the 26 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.CO2011
Tangles, trees, and flowers
Ben Clark, Geoff Whittle
A tangle of order in a matroid or graph may be thought of as a "-connected component". For a tangle of order in a matroid or graph that satisfies a certain robustness co…
math.CO2011★ 2 cited
Certifying Non-representability of Matroids Over Prime Fields
Jim Geelen, Geoff Whittle
It is proved that, for a prime number , showing that an -element matroid is not representable over requires only rank evaluations.
math.CO2011★ 4 cited
Inequivalent Representations of Matroids over Prime Fields
Jim Geelen, Geoff Whittle
It is proved that for each prime field , there is an integer such that a 4-connected matroid has at most inequivalent representations over . We also pro…