7 citations · 13 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 1 cited
Is the missing axiom of matroid theory lost forever?
Dillon Mayhew, Mike Newman, Geoff Whittle
We conjecture that it is not possible to finitely axiomatize matroid representability in monadic second-order logic for matroids, and we describe some partial progress towards this…
math.CO2012★ 1 cited
A note on packing spanning trees in graphs and bases in matroids
Robert F. Bailey, Mike Newman, Brett Stevens
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where th…