Graphs and matroids are two of the most important objects in combinatorics.We study invariants of graphs and matroids that behave well with respect to certain morphisms by realizing these invariants as functors from a ...