A connectivity function is a symmetric, submodular set function. Connectivity functions capture
connectivity in many combinatorial structures, for example in graphs, hypergraphs, matroids and
polymatroids. Moreover they have strong properties in their own right. The natural question is: How general
are connectivity functions? In this talk I will address this question.
This is joint work with Susan Jowett and Songbao Mo.