Convergent sequences of combinatorial submodular setfunctions

To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate sequences can be proved. Some of the proofs are surprisingly nontrivial.