Recognition Problems for Connectivity Functions
A connectivity function is a symmetric, submodular set function. Connectivity functions arise naturally from graphs, matroids and other structures. This thesis focuses mainly on recognition problems for connectivity functions, that is when a connectivity function comes from a particular type of structure. In particular we give a method for identifying when a connectivity function comes from a graph, which uses no more than a polynomial number of evaluations of the connectivity function. We also give a proof that no such method can exist for matroids.